The difference records of OEIS A166944 are unbounded
ProvedA166944Research.difference_records_unboundedLet be the Rowland-type recursion of OEIS A166944,
with first differences . Call a difference record if for some and for every : a strict running maximum of , attained.
The theorem asserts that these records are unbounded:
Equivalently, for every threshold there is an index at which the difference sequence exceeds for the first time. The proof is effective: the witness satisfies uniformly, because the argument bounds the index of the next record above by an explicit least common multiple.
This is the monotone half of the A166944 conjecture and it is the step that turns the conjecture into a statement about primality alone. The conjecture itself,
is open; this theorem removes the combinatorial part of it and leaves only the arithmetic part. It is the natural first lemma for anyone approaching the conjecture, and the companion theorem unbounded_greater_twin_primes_of_target records that the conjecture would imply arbitrarily large twin-prime pairs.
Formalization Note Indices are restricted to throughout, the range in which d is the true difference rather than a truncated subtraction. R is the value of the record, not its index; the index is bounded separately by recordHorizonBound.
import Definitions.Def_a166944_record_core open A166944Research
namespace A166944Research
theorem difference_records_unbounded (M : Nat) :
∃ R : Nat, M < R ∧ IsDifferenceRecord R := by sorry
end A166944Research