Browse · MathNet
PrintSaudi Arabia Mathematical Competitions
Saudi Arabia number theory
Problem
Let be the sequence of Fibonacci numbers: , and , for every . Prove that for any prime , divides .
Solution
Observe that where is the Lucas number, that is it follows . Now hence , since divides , and , and .
Techniques
Fermat / Euler / Wilson theoremsAlgebraic properties of binomial coefficientsRecurrence relationsPrime numbers