Prime-Rich Row Equations of the 'Special' Array,
Abstract
In two previous reports, a method of finding prime-rich equations of the type I=x squared -x+c, c+2N-1, N=1,2,3...was described. It was based on an analysis of a certain array, discovered by the author, which has the property that every column of the array can be described by the Diophantine form (integer solutions only) of the above equation. In addition, the rows of the same array can be represented by the related equation I=x squared +x-r, r=2N-1, and N=1,2,3... A number of prime-rich 'column' equations were found by the method described. This report applies the same method of analysis to show that there are about as many 'row' equations which are richer in primes than Euler's equation, I=x -x+41, as were found for the 'column' equations. Keywords: Prime number theory.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1987
- Accession Number
- ADA182932
Entities
People
- R. S. Sery
Organizations
- Naval Ordnance Laboratory