On the Smallest k Such that All k ⋅2 N + 1 are Composite

DOI10.2307/2007382zbMath0502.10001OpenAlexW4248468851MaRDI QIDQ3967592

G. Jaeschke

Publication date: 1983

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007382

zbMATH Keywords

Sierpinski numbersSierpinski problem

Mathematics Subject Classification ID

Factorization; primality (11A51)

Related Items (6)

Unnamed Item ⋮ Five consecutive positive odd numbers, none of which can be expressed as a sum of two prime powers ⋮ Five consecutive positive odd numbers none of which can be expressed as a sum of two prime powers. II ⋮ On integers of the forms \(k-2^n\) and \(k2^n+1\) ⋮ On integers of the forms \(k^r-2^n\) and \(k^r2^n+1\). ⋮ On integers of the form 𝑘2ⁿ+1

This page was built for publication: On the Smallest k Such that All k ⋅2 N + 1 are Composite