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

DOI10.2307/2007382MaRDI QIDQ3967592zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Problem of Sierpinski Concerning k ⋅2 n + 1
• scientific article; zbMATH DE number 1475155
• On integers of the forms \(k^r-2^n\) and \(k^r2^n+1\).
• On integers of the forms \(k-2^n\) and \(k2^n+1\)
• scientific article; zbMATH DE number 5274211

Cited in

(9)

• Five consecutive positive odd numbers none of which can be expressed as a sum of two prime powers. II
• The Problem of Sierpinski Concerning k ⋅2 n + 1
• On the equation \(\varphi (n+k)=2 \varphi(n)\)
• On integers of the forms \(k-2^n\) and \(k2^n+1\)
• Resolution of the mixed Sierpiński problem
• On integers of the forms \(k^r-2^n\) and \(k^r2^n+1\).
• On integers of the form 𝑘2ⁿ+1
• Five consecutive positive odd numbers, none of which can be expressed as a sum of two prime powers
• Integers not of the form \(2^n +p^{\alpha} q^{\beta}\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967592)