Fibonacci strong divisibility
Theorem.Fibonacci strong divisibility — gcd(F_m, F_n) = F_{gcd(m,n)}.
Proof.gcd(F_m, F_n) = F_gcd(m,n) for all 900 pairs m, n ≤ 30, computed on the one-math gcd — Lucas cited for all m, n.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/waves/index.ts#discoveredTheoremsWaveThree
1 · Classification
finite-complete — computed witness within a cited frame (the unbounded form leans on the cited literature)
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Fibonacci strong divisibility" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveThree.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveThree @ src/thunder/waves) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveThree (src/thunder/waves/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.