fibonacci_prime_factors
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Wall-Sun-Sun prime (Fibonacci-Wieferich): The prime p divides Fib(p-1) iff p ≡ ±1 (mod 5), and divides Fib(p+1) iff p ≡ ±2 (mod 5). Whether there exists a prime p² | Fib(p±1) (a Wall-Sun-Sun prime) is open.
Why this node was retired
The posted statement is
import Mathlib
theorem fibonacci_prime_factors :
∀ p : ℕ, Nat.Prime p →
p ∣ Nat.fib p ↔ p = 5 ∨ p % 5 = 1 ∨ p % 5 = 4 := by
sorry
The divisibility test uses F_p instead of a residue-selected F_(p−1) or F_(p+1); implication/iff grouping is also misleading.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
For primes p≠2,5 state p∣F_(p−(p/5)), with the Legendre-symbol-selected index. If retaining F_p, the elementary correct criterion is p∣F_p iff p=5, explicitly parenthesized after the primality premise.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem fibonacci_prime_factors :
∀ p : ℕ, Nat.Prime p →
p ∣ Nat.fib p ↔ p = 5 ∨ p % 5 = 1 ∨ p % 5 = 4 := by
sorry