scientific article; zbMATH DE number 1475155
\textit{W. Sierpiński} [Elem. Math. 15, 73-74 (1960; Zbl 0093.04602)] found that, for each \(k\leq 100\), except perhaps 47 and 94, there is an \(n\) such that \(k\cdot 2^n+1\) is prime, and more recently \textit{W. Bosma} [Math. Comput. 61, 97-109 (1993; Zbl 0817.11060)] also studied the case \(k\cdot 2^n-1\). Interest in such numbers arises from primality criteria associated with Fermat and Mersenne numbers due to Pepin, Lucas and Lehmer. From computations the author finds that \(k=509203\) is likely to be the smallest number for which \(k\cdot 2^n-1\) is composite for all \(n\geq 1\), with \(\{3,5,7,13,17,241\}\) being the covering set of divisors. Four other values of \(k\leq 10^6\) with such a property are \(762701,777149,790841,992077\).
- Corrigendum
- On composite odd numbers k for which 2ⁿ k is a noncototient for all positive integers n
- scientific article; zbMATH DE number 3966173
- scientific article; zbMATH DE number 3513870
- On thenth composite number
- On composite integers \(n\) for which \(\varphi(n)\mid n-1\)
- On composite n for which φ(n) | n -1
- Publication:3029063
- On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\)
- The least pseudoprime of the form \(2^N-2\)
- Resolution of the mixed Sierpiński problem
- The Problem of Sierpinski Concerning k ⋅2 n + 1
- On the Smallest k Such that All k ⋅2 N + 1 are Composite
- scientific article; zbMATH DE number 797181 (Why is no real title available?)
- Sierpiński numbers in imaginary quadratic fields
- On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489765)
