Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Definitions (printed p. 1713). A sequence of integers is admissible when, for each prime , some residue class modulo contains none of the . The paper sets to be the largest number of elements of an admissible sequence lying in an interval of length , and to be the limit superior, as the shift tends to infinity, of the number of primes in an interval of length . The print writes the latter as "" [sic], with the roles of and crossed; the reading consistent with the rest of the paper is .
Conjecture A (Prime -tuples Conjecture, p. 1713). "Let be an admissible sequence. Then there exist infinitely many integers for which are prime."
Conjecture B (p. 1713). "."
The paper attributes both conjectures to Hardy and Littlewood (its reference [2], Acta Math. 44 (1923)). Conjecture B is printed with no quantifier on and ; the paper glosses it as saying that no interval of length holds more primes than the initial interval . It states that Conjecture A implies , and recalls, from Hensley and Richards (its reference [3]), that for all large enough , so that Conjecture B is incompatible with Conjecture A. That theorem is cited here, not proved; its library home is hensley_1974_primes_intervals.
Source. David A. Clark and Norman C. Jarvis, "Dense admissible sequences," Mathematics of Computation 70(236) (2001), 1713--1718, https://doi.org/10.1090/s0025-5718-01-01348-5; § 1, printed p. 1713. The edition read is identified on the source card.
Read depth. Claims checked: the definitions and Conjectures A and B were read clause by clause on the page image of p. 1713. Nothing here is independently reviewed.
Proof pointer
A conjecture and definitions; nothing is proved. The implication from Conjecture A to is asserted on p. 1713 without proof.
Dependencies
None within the paper. The incompatibility with Conjecture A rests on the cited Hensley--Richards theorem.
Bears on
- Problem 855: Conjecture B is the problem's inequality written for an interval of length starting at . The problem asks it for large and ; the paper prints it with no quantifier. The function defined here is the quantity the paper's computations bound.