You are not currently logged in.
Access JSTOR 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.
The Problem of Sierpiński Concerning $k \cdot 2^n + 1$
Robert Baillie, G. Cormack and H. C. Williams
Mathematics of Computation
Vol. 37, No. 155 (Jul., 1981), pp. 229-231
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2007516
Page Count: 3
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
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
Let $k_0$ be the least odd value of $k$ such that $k \cdot 2^n + 1$ is composite for all $n \geqslant 1$. In this note, we present the results of some extensive computations which restrict the value of $k_0$ to one of 119 numbers between 3061 and 78557 inclusive. Some new large primes are also given.
Mathematics of Computation © 1981 American Mathematical Society