Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Not every number is the sum or difference of two prime powers


Authors: Fred Cohen and J. L. Selfridge
Journal: Math. Comp. 29 (1975), 79-81
MSC: Primary 10J15; Secondary 10-04
DOI: https://doi.org/10.1090/S0025-5718-1975-0376583-0
MathSciNet review: 0376583
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Every odd number less than 262144 is the sum or difference of a power of two and a prime. An interesting example is $ 113921 = p - {2^{141}}$. Using covering congruences, we exhibit a 26-digit odd number which is neither the sum nor difference of a power of two and a prime. The method is then modified to exhibit an arithmetic progression of numbers which are not the sum or difference of two prime powers.


References [Enhancements On Off] (What's this?)

  • [1] P. Erdös, On integers of the form 2^{𝑘}+𝑝 and some related problems, Summa Brasil. Math. 2 (1950), 113–123. MR 0044558

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10J15, 10-04

Retrieve articles in all journals with MSC: 10J15, 10-04


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1975-0376583-0
Article copyright: © Copyright 1975 American Mathematical Society