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

Fred Cohen, J. L. Selfridge

Mathematics of Computation · 1975 · 59 citations · 0 references

DOIFull text

Open access

Concepts

Abstract

Every odd number less than 262144 is the sum or difference of a power of two and a prime. An interesting example is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="113921 equals p minus 2 Superscript 141"> <mml:semantics> <mml:mrow> <mml:mn>113921</mml:mn> <mml:mo>=</mml:mo> <mml:mi>p</mml:mi> <mml:mo> − </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mn>2</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>141</mml:mn> </mml:mrow> </mml:msup> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">113921 = p - {2^{141}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . 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.