MathDB
Fibonacci

Source: KöMaL A. 730

October 11, 2018
number theory

Problem Statement

Let FnF_n be the nnth Fibonacci number (F1=F2=1F_1=F_2=1 and Fn+1=Fn+Fn−1F_{n+1}=F_n+F_{n-1}). Construct infinitely many positive integers nn such that nn divides FFnF_{F_n} but nn does not divide FnF_n.
Back to ProblemsView on AoPS