On the smallest such that all are composite

Author:
G. Jaeschke

Journal:
Math. Comp. **40** (1983), 381-384

MSC:
Primary 10A25; Secondary 10-04

DOI:
https://doi.org/10.1090/S0025-5718-1983-0679453-8

Corrigendum:
Math. Comp. **45** (1985), 637.

MathSciNet review:
679453

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In this note we present some computational results which restrict the least odd value of *k* such that is composite for all 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 is prime but is not prime for .

**[1]**R. Baillie, G. Cormack & H. C. Williams, "The problem of Sierpinski concerning ,"*Math. Comp.*, v. 37, 1981, pp. 229-231. Corrigenda,*Math. Comp.*, v. 39, 1982, p. 308. MR**616376 (83a:10006a)****[2]**N. S. Mendelsohn, "The equation ,"*Math. Mag.*, v. 49, 1976, pp. 37-39. MR**0396385 (53:252)****[3]**J. L. Selfridge, "Solution to problem 4995,"*Amer. Math. Monthly*, v. 70, 1963, p. 101. MR**1532000****[4]**W. Sierpinski, "Sur un probleme concernant les nombres ,"*Elem. Math.*, v. 15, 1960, pp. 73-74. MR**0117201 (22:7983)****[5]**R. G. Stanton & H. C. Williams,*Further Results on Coverings of the Integers**by Primes*, Lecture Notes in Math., vol. 884, Combinatorial Mathematics VIII, pp. 107-114, Springer-Verlag, Berlin and New York, 1980.

Retrieve articles in *Mathematics of Computation*
with MSC:
10A25,
10-04

Retrieve articles in all journals with MSC: 10A25, 10-04

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1983-0679453-8

Article copyright:
© Copyright 1983
American Mathematical Society