I love hate Fibonacci
Number Theory
Level
2
Find the smallest \(n>1\) such that \(F_n=n^2\) where \(F_m\) is the \(m^{\text{th}} \) Fibonacci number.
by
siddharth bhatt