Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This is Plasma AI's author-recorded algebraic comparison for the phase-transport route to Problem 251. It has not been independently reviewed. It identifies the best universal bound obtainable by averaging doubled endpoint phases, and the arithmetic information that would make that bound strict. It proves no estimate for the actual prime sequence and does not resolve the irrationality question.
The exact optimization
Let be a finitely supported real sequence with . Put
Then
The same equality holds if all coefficients are required to be nonnegative. In both cases an optimizer is , , with all other coefficients zero.
Proof. Since , every summand at is . Normalization therefore gives , including for signed coefficients. This proves the lower bound. For the displayed optimizer, put and use . Directly,
Equality holds exactly when or .
For any finite list of phases, summing (H2) gives the corresponding ceiling times the length of the list. A list consisting entirely of nontrivial cube-root phases attains it for every normalized mixture. Thus neither more doubled frequencies nor signed coefficients can give a smaller universal ceiling in this class. This is an obstruction to a bound using arbitrary phases; it is not an obstruction to exploiting additional properties of prime tails.
The prime-tail interface
Use the phase-transport notation
Fix an odd integer , let be the odd positive integers not divisible by , and let be its half-gap tail from . Fix a positive integer multiplier and suppose the reference is resonant in the precise sense
This hypothesis holds, for example, for , whose two reference tails are and . The statements below retain (H3) as a hypothesis rather than infer it for an arbitrary reference. Proposition P9 of the transport note supplies such a reference with an odd multiple of each fixed odd denominator : writing with , it takes and . This author-recorded construction verifies (H3), without estimating actual prime tails. Put and , for .
For a fixed nonnegative integer , write for the dephased transport with multiplier , so its carries and gap arguments are also multiplied by . The endpoint proof of Proposition P4 in the transport note gives
The telescoping proof applies to each fixed positive multiplier: it uses the recurrence for the carries and the reference tails, containment of every sufficiently large prime in , and its stated boundary estimates. It uses neither oddness of the multiplier nor primality of for this unconditional endpoint. The comparison uses that endpoint only; it does not require progression equidistribution or a sharper boundary error. All multipliers here are fixed before tends to infinity. If the frequencies grow with , their endpoint errors need a separate uniform bound; the fixed-parameter identity supplies none.
Define
By (H2) and (H4),
In particular, the unconditional ceiling is . A fixed strict saving below on unbounded scales is equivalent, after adjusting a positive margin for the error, to
This demands a positive proportion of energy, not merely one nonzero term. Equivalently, there must be fixed and unbounded scales on which at least indices satisfy . Indeed the square is at most . If , the indices with square at least number at least , since the other indices contribute at most . The converse follows by summing the squares on the specified indices.
The individual zeros need careful interpretation. If , where , then
Thus a zero summand does not by itself imply an integer carry. Conversely, eventually integer carries make every sufficiently late summand zero. No lower bound in (H6) is established here.
Why doubling does not change the rationality sum
The site weight, with its multiplier displayed, is
It is absolutely convergent. If and , then for every integer ,
For , the first term on the left is ; both cosines are . Reindexing the remaining absolutely convergent terms gives the right side. Iterating is legitimate because is integral and multiplication by two preserves the two nonzero residues modulo three. This proves (H8).
At a composite site in the prime gap , the transport uses . If is integral, then so is . Consequently eventually integer carries give exactly for all sufficiently large , for every fixed . Every normalized finite mixture therefore has the same actual site sum under this hypothesis. Its unconditional description may differ, as (H5) shows, but frequency averaging has supplied no arithmetic saving.
The remaining whole-conclusion step
Suppose with odd. The canonical sketch's Lemma A gives eventually integer . If is a fixed integer multiple of and the chosen reference satisfies (H3), then is eventually integral. Equations (H3)--(H5) force . A strict upper bound for this actual-prime sum on unbounded scales would give a contradiction.
For a complete proof this step must work for each odd , with a suitable fixed resonant reference and multiplier divisible by . Constants and the unbounded scales may depend on , and the upper argument may use the eventual integrality forced by the assumed rational value. This note supplies neither that upper argument nor (H6).
The sharp bound (H1) closes only the proposed purely algebraic improvement by normalized doubled phases. Reopening that approach needs an additional restriction on the actual phases strong enough to force (H6), or a signed arithmetic estimate for the transport retaining its prime-gap-selected coefficient and every cofactor. A bound merely attaining the universal ceiling does not fill the strict-saving gap. These conclusions change no other route in the canonical sketch.