You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
On the Smallest $k$ Such that All $k \cdot 2^N + 1$ are Composite
Mathematics of Computation
Vol. 40, No. 161 (Jan., 1983), pp. 381-384
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2007382
Page Count: 4
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
In this note we present some computational results which restrict the least odd value of $k$ such that $k \cdot 2^n + 1$ is composite for all $n \geqslant 1$ to one of 91 numbers between 3061 and 78557, inclusive. Further, we give the computational results of a relaxed problem and prove for any positive integer $r$ the existence of infinitely many odd integers $k$ such that $k \cdot 2^r + 1$ is prime but $k \cdot 2^v + 1$ is not prime for $v < r$.
Mathematics of Computation © 1983 American Mathematical Society