Dense admissible sequences

Authors:
David A. Clark and Norman C. Jarvis

Journal:
Math. Comp. **70** (2001), 1713-1718

MSC (2000):
Primary 11B83, 11N13

DOI:
https://doi.org/10.1090/S0025-5718-01-01348-5

Published electronically:
March 22, 2001

MathSciNet review:
1836929

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

A sequence of integers in an interval of length is called admissible if for each prime there is a residue class modulo the prime which contains no elements of the sequence. The maximum number of elements in an admissible sequence in an interval of length is denoted by . Hensley and Richards showed that for large enough . We increase the known bounds on the set of satisfying and find smaller values of such that . We also find values of satisfying . This shows the incompatibility of the conjecture with the prime -tuples conjecture.

**1.**P. Erdős,*Problems and results in number theory*, Recent progress in analytic number theory, Vol. 1 (Durham, 1979) Academic Press, London-New York, 1981, pp. 1–13. MR**637339****2.**G.H. Hardy and J.E. Littlewood,*Some problems of 'partitio numerorum'. III. On the expression of a number as a sum of primes*, Acta Math.**44**(1923), 1-70.**3.**Douglas Hensley and Ian Richards,*Primes in intervals*, Acta Arith.**25**(1973/74), 375–391. MR**0396440****4.**Hans Riesel,*Prime numbers and computer methods for factorization*, 2nd ed., Progress in Mathematics, vol. 126, Birkhäuser Boston, Inc., Boston, MA, 1994. MR**1292250****5.**A. Schinzel,*Remarks on the paper “Sur certaines hypothèses concernant les nombres premiers”*, Acta Arith.**7**(1961/1962), 1–8. MR**0130203****6.**Herschel F. Smith,*On a generalization of the prime pair problem*, Math. Tables Aids Comput.**11**(1957), 249–254. MR**0094314**, https://doi.org/10.1090/S0025-5718-1957-0094314-8**7.**T. Vehka and I. Richards,*Explicit construction of an admissible set for the conjecture that sometimes*, Notices Amer. Math. Soc. (1979), A-453.

Retrieve articles in *Mathematics of Computation*
with MSC (2000):
11B83,
11N13

Retrieve articles in all journals with MSC (2000): 11B83, 11N13

Additional Information

**David A. Clark**

Affiliation:
Department of Mathematics, Brigham Young University, Provo, Utah, 84602

Email:
clark@math.byu.edu

**Norman C. Jarvis**

Affiliation:
Department of Mathematics, Brigham Young University, Provo, Utah, 84602

Email:
jarvisn@math.byu.edu

DOI:
https://doi.org/10.1090/S0025-5718-01-01348-5

Received by editor(s):
August 5, 1996

Received by editor(s) in revised form:
April 18, 1997

Published electronically:
March 22, 2001

Additional Notes:
After this paper was submitted, the authors learned that Dan Gordon and Gene Rodemich have extended the calculation of $𝜌^{*}(n)$ to $n=1600$.

Article copyright:
© Copyright 2001
American Mathematical Society