A long quiet A166944 tail certifies both twin factors
ProvedA166944Research.a166944_quiet_tail_no_small_factorsLet be the OEIS A166944 recurrence and its first differences. Suppose is a moving-horizon state and the tail is quiet: for every . If the tail is long compared with , in the sense , then neither nor has any divisor in :
The mechanism is that a divisor is also a position. A factor of can be reflected across the horizon to the index , and a factor of to ; the bound is exactly what keeps inside the quiet tail. At such an index the recurrence is forced to increment by exactly , while the divisibility structure forces the increment to be a nontrivial gcd -- a contradiction. The parity split is what makes the reflection land on an index of the correct parity for the branch.
This is the step that converts quietness into coprimality at the horizon's two neighbours, which is in turn what makes the next difference record a twin prime. It is the only place in the terminal argument where the length of the quiet tail enters.
import Definitions.Def_a166944_moving_horizon import Definitions.Def_a166944_factor_layer open A166944Research
namespace A166944Research
theorem a166944_quiet_tail_no_small_factors {sf Cf root : Nat}
(hstate : IsMovingHorizonState sf Cf)
(hquiet : ∀ j : Nat, sf < j → j ≤ Cf → d j = 1)
(hlong : 2 * root < Cf - sf) :
NoSmallFactor (Cf - 1) root ∧ NoSmallFactor (Cf + 1) root := by
sorry
end A166944Research