Primes differing by a fixed integer

Authors:
W. G. Leavitt and Albert A. Mullin

Journal:
Math. Comp. **37** (1981), 581-585

MSC:
Primary 10L10; Secondary 10H15

DOI:
https://doi.org/10.1090/S0025-5718-1981-0628716-9

MathSciNet review:
628716

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: It is shown that the equation is always solvable by where are primes differing by the integer *m*. This is called the "Standard" solution of and an *m* for which this is the only solution is called a "-number". While there are an infinite number of non -numbers there are many (almost certainly infinitely many) -numbers, including (the twin prime case). A procedure for calculating all non -numbers less than a given bound *L* is devised and a table is given for .

**[1]**S. A. Sergušov,*On the problem of prime-twins*, Jaroslav. Gos. Ped. Inst. Učen. Zap.**Vyp. 82 Anal. i Algebra**(1971), 85–86 (Russian). MR**0480384**

Retrieve articles in *Mathematics of Computation*
with MSC:
10L10,
10H15

Retrieve articles in all journals with MSC: 10L10, 10H15

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1981-0628716-9

Article copyright:
© Copyright 1981
American Mathematical Society