Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Dense admissible sequences

Authors: David A. Clark and Norman C. Jarvis
Journal: Math. Comp. 70 (2001), 1713-1718
MSC (2000): Primary 11B83, 11N13
Published electronically: March 22, 2001
MathSciNet review: 1836929
Full-text PDF

Abstract | References | Similar Articles | Additional Information


A sequence of integers in an interval of length $x$ 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 $x$ is denoted by $\varrho ^{*}(x)$. Hensley and Richards showed that $\varrho ^{*}(x)>\pi (x)$ for large enough $x$. We increase the known bounds on the set of $x$ satisfying $\varrho ^{*}(x)\le \pi (x)$ and find smaller values of $x$ such that $\varrho ^{*}(x)>\pi (x)$. We also find values of $x$ satisfying $\varrho ^{*}(x)>2\pi (x/2)$. This shows the incompatibility of the conjecture $\pi (x+y)-\pi (y)\le 2\pi (x/2)$ with the prime $k$-tuples conjecture.

References [Enhancements On Off] (What's this?)

  • 1. P. Erdös, Problems and results in number theory, Recent Progress in Analytic Number Theory, Vol. 1, Academic Press, New York, 1981, pp. 1-13. MR 84j:10001
  • 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. D. Hensley and I. Richards, Primes in intervals, Acta Arith. 25 (1974), 375-391. MR 53:305
  • 4. H. Riesel, Prime numbers and computer methods for factorization, Birkhäuser, Boston, 1994. MR 95h:11142
  • 5. A. Schinzel, Remarks on the paper `Sur certaines hypothèses concernant les nombres premiers', Acta Arith. 7 (1961/1962), 1-8. MR 24:A70
  • 6. H. Smith, On a generalization of the prime pair problem, Math. Tables Other Aids Comput. 11 (1957), 249-254. MR 20:833
  • 7. T. Vehka and I. Richards, Explicit construction of an admissible set for the conjecture that sometimes $\pi (x+y)>\pi (x)+\pi (y)$, Notices Amer. Math. Soc. (1979), A-453.

Similar Articles

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

Norman C. Jarvis
Affiliation: Department of Mathematics, Brigham Young University, Provo, Utah, 84602

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

American Mathematical Society