I love hate Fibonacci

Find the smallest \(n>1\) such that \(F_n=n^2\) where \(F_m\) is the \(m^{\text{th}} \) Fibonacci number.

×

Problem Loading...

Note Loading...

Set Loading...