게시판

동문 뉴스

Problem of the week

For each \( i \in \mathbb{N}\), let \(F_i\) be the \(i\)-th Fibonacci number where \(F_0=0, F_1=1\) and \(F_{i+1}=F_{i}+F_{i-1}\) for each \(i\geq 1\).
For \(n>m\), we divide \(F_n\) by \(F_m\) to obtain the remainder \(R\). Prove that either \(R\) or \(F_m-R\) is a Fibonacci number.