How many perfect squares are in the Fibonacci sequence? This problem can be extended to ... the tribonacci.

Hi iiooasd1217,

I only found six solutions (0, 1, 4, 81, 3136 and 10609) in the first 100,000 tribonacci numbers.

10609 is the 19th tribonacci number (sequence A000073 in the OEIS).

And as with the Fibonacci problem, I called a halt in my search at 100,000.

My Mathematica code:

```
In[1]:= AbsoluteTiming[Select[Sqrt@LinearRecurrence[{1,1,1},{0,0,1},100000],IntegerQ]^2]
Out[1]= {7393.1776884,{0,0,1,1,4,81,3136,10609}}
```

How many perfect squares are in the Fibonacci sequence?

Hi iiooasd1217,

I could only find 0, 1 and 144 in the first 100,000 Fibonacci numbers.

144 is the 13th Fibonacci number (sequence A000045 in the OEIS).

My Mathematica code:

```
In[1]:= AbsoluteTiming[Select[Sqrt@LinearRecurrence[{1,1},{0,1},100000],IntegerQ]^2]
Out[1]= {5206.4986953,{0,1,1,144}}
```

Computing speed with that code is about the same as with M's Fibonacci function: Table[Fibonacci[n], {n, 100000}].

Testing to 1M would tie up my computer for longer than I'd like, so I'll quit now.

Also, extending my test range may be a fruitless exercise, as in his article Square Fibonacci Numbers, Etc, John H. E. Cohn 'apparently' proves that there are no more results than just the three I found.

I say 'apparently', because his proof is way beyond my understanding.

The article begins:

"An old conjecture about Fibonacci numbers is that 0, 1 and 144 are the only perfect squares. Recently there appeared a report that computation had revealed that among the first million numbers in the sequence there are no further squares [1]. This is not surprising, as I have managed to prove the truth of the conjecture..."