(2 TO THE nth POWER) - 21,382,107,400,956,509,849 IS NEVER A PRIME
Abstract
The sequence ((2 to the nth power) - a) for fixed a has been studied by many mathematicians. For a = +1, those ((2 to the nth power) - 1) which are primes are called Mersenne primes. For a = -1, the primes of the form ((2 to the nth power) + 1) are called Fermat primes. Clearly if a is even the only possible prime would be 2. In this note, an odd a is found such that ((2 to the nth power) - a) is never a prime.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1969
- Accession Number
- AD0696113
Entities
People
- Joel Spencer
Organizations
- RAND Corporation