MathDB
Fibonacci sequence

Source: Mathematics Regional Olympiad of Mexico Southeast 2017 P6

October 24, 2021
Fibonaccinumber theory

Problem Statement

Consider f1=1,f2=1f_1=1, f_2=1 and fn+1=fn+fn−1f_{n+1}=f_n+f_{n-1} for n≥2n\geq 2. Determine if exists n≤1000001n\leq 1000001 such that the last three digits of fnf_n are zero.
Back to ProblemsView on AoPS