ILL 1974 Problem 2
Let be the Fibonacci sequence, i.e., for . Prove that there exist infinitely many prime numbers that divide .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.