MathDB
f_n = n^2, Fibonacci

Source: 1973 Swedish Mathematical Competition p2

March 26, 2021
fibonacci numberalgebraSequencerecurrence relation

Problem Statement

The Fibonacci sequence f1,f2,f3,…f_1,f_2,f_3,\dots is defined by f1=f2=1f_1=f_2=1, fn+2=fn+1+fnf_{n+2}=f_{n+1}+f_n. Find all nn such that fn=n2f_n = n^2.
Back to ProblemsView on AoPS