The problem of Sierpiński concerning $k\cdot 2^{n}+1$
HTML articles powered by AMS MathViewer
- by Robert Baillie, G. Cormack and H. C. Williams PDF
- Math. Comp. 37 (1981), 229-231 Request permission
Corrigendum: Math. Comp. 39 (1982), 308.
Corrigendum: Math. Comp. 39 (1982), 308.
Abstract:
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.References
- G. V. Cormack and H. C. Williams, Some very large primes of the form $k\cdot 2^{m}+1$, Math. Comp. 35 (1980), no. 152, 1419–1421. MR 583519, DOI 10.1090/S0025-5718-1980-0583519-8
- P. Erdős and A. M. Odlyzko, On the density of odd integers of the form $(p-1)2^{-n}$ and related questions, J. Number Theory 11 (1979), no. 2, 257–263. MR 535395, DOI 10.1016/0022-314X(79)90043-X
- Richard K. Guy, Unsolved combinatorial problems, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969) Academic Press, London, 1971, pp. 121–127. MR 0277393
- Oystein Ore, J. L. Selfridge, and P. T. Bateman, Advanced Problems and Solutions: Solutions: 4995, Amer. Math. Monthly 70 (1963), no. 1, 101–102. MR 1532000, DOI 10.2307/2312814
- W. Sierpiński, Sur un problème concernant les nombres $k\cdot 2^{n}+1$, Elem. Math. 15 (1960), 73–74 (French). MR 117201 W. Sierpiński, 250 Problems in Elementary Number Theory, American Elsevier, New York, 1970, p. 10 and p. 64.
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Math. Comp. 37 (1981), 229-231
- MSC: Primary 10A25
- DOI: https://doi.org/10.1090/S0025-5718-1981-0616376-2
- MathSciNet review: 616376