Dense admissible sequences
HTML articles powered by AMS MathViewer
- by David A. Clark and Norman C. Jarvis PDF
- Math. Comp. 70 (2001), 1713-1718 Request permission
Abstract:
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
- 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
- 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.
- Douglas Hensley and Ian Richards, Primes in intervals, Acta Arith. 25 (1973/74), 375–391. MR 396440, DOI 10.4064/aa-25-4-375-391
- 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, DOI 10.1007/978-1-4612-0251-6
- A. Schinzel, Remarks on the paper “Sur certaines hypothèses concernant les nombres premiers”, Acta Arith. 7 (1961/62), 1–8. MR 130203, DOI 10.4064/aa-7-1-1-8
- Herschel F. Smith, On a generalization of the prime pair problem, Math. Tables Aids Comput. 11 (1957), 249–254. MR 94314, DOI 10.1090/S0025-5718-1957-0094314-8
- 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.
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
- 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 $\rho ^{*}(n)$ to $n=1600$.
- © Copyright 2001 American Mathematical Society
- Journal: Math. Comp. 70 (2001), 1713-1718
- MSC (2000): Primary 11B83, 11N13
- DOI: https://doi.org/10.1090/S0025-5718-01-01348-5
- MathSciNet review: 1836929