The eventual period of Γ(k,Fₙ): ninety new values and a closed form in Pisano periods
Abstract
For relatively prime positive integers a,b exactly one of the two Diophantine equations ax+by=(a-1)(b-1)/2 and 1+ax+by=(a-1)(b-1)/2 has a nonnegative integral solution, and Γ(a,b) ∈ {0,1} records which one. Chu, Miller and Tresch (arXiv:2512.12681) write Tₖ((aₙ)) for the eventual period of (Γ(k,aₙ))_(n ≥ 1), prove that Tₖ((Fₙ)) divides the Pisano period π(2k), print Tₖ((Fₙ)) for k ≤ 10, and ask for its value for every k. We compute the ninety values 11 ≤ k ≤ 100 and verify, for every k ≤ 200 by machine-checked computation from the Diophantine definition and for every k ≤ 2000 by an independent computation, that Tₖ((Fₙ))=π(Pₖ), where Pₖ (=k for odd k, 2k for even k) is the period of Γ(k, ·) on ℕ; that is, Tₖ((Fₙ))=π(k) for odd k and π(2k) for even k. This value is strictly smaller than π(2k) for 60 of the first 200 values of k, among them k=3 of the printed table, and the set of k with Tₖ((Fₙ))=2π(k) is not the set of powers of two (k=40 is the least counterexample) but is described by a 2-adic condition on the Pisano period of the odd part of k. For the companion problem on arithmetic progressions pn-r we note that the coprime case gcd(k,p)=1 follows for every k from the source's own periodicity theorem, and exhibit T₁₅((5n-1))=1 and T₆((2n))=3 ≠ 6=T₆((2n-1)), which rule out the natural candidate formulas in the non-coprime range. The closed form for all k is stated as a conjecture. Every computational statement is verified in Lean 4 by evaluated computation, without Mathlib.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-09-07 03:53 UTC
File fingerprint
86c75af48376cff906cab3eba495201c42834e59af21cd8e1a52f314978956b8
Claim ledger
Stated results
GFP-01known data2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-02candidate2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-03candidate2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-04candidate2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-05known2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-06known2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-07known2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-08known2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-09routine2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-10candidate2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
GFP-11routine2026-09-03
Statement description is not included in this imported ledger snapshot. See the PDF for the full theorem wording.
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- For relatively prime a, b ∈ ℕ, exactly one of
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7