Below 1000, the A166944 first differences are composite only at indices 18, 66 and 150
ProvedA166944Research.composite_differences_below_1000Let be the Rowland-type recursion of OEIS A166944 with first differences , and let be the trial-division test that returns true exactly when has a proper divisor.
The theorem classifies every composite first difference below :
Equivalently: among the indices , the difference is composite at exactly three of them, namely
and nowhere else in the range.
The result is a finite classification, and it is established by kernel evaluation rather than by a sampled scan: the statement is a bounded universal quantifier over List.range 1001, so decide checks all indices. It is the first complete census of the composite values of in any range, and it isolates the three exceptional indices that any general argument about composite differences has to account for. In the A166944 conjecture the three are exactly the obstruction: records are required to be prime, so a composite difference can never be a record, and these are the only composite differences in the range to test that against.
Formalization Note The quantifier is over List.range 1001, i.e. the indices , and n = 0 and n = 1 are disposed of by the hypothesis since is not composite. The evaluation needs maxRecDepth 1000000; the heaviest instance takes about twelve seconds.
import Definitions.Def_a166944_composite_test open A166944Research
namespace A166944Research
theorem composite_differences_below_1000 :
∀ n ∈ List.range 1001, isComposite (d n) = true → n = 18 ∨ n = 66 ∨ n = 150 := by
sorry
end A166944Research