This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice that 1 3 + 2 1 = 3 4 , 2 1 + 3 4 = 5 5 , and so on...
All these numbers are part of the Fibonacci sequence , and in this particular scenario we can use the Gelin-Cesàro Identity , which states F n 4 − F n − 2 F n − 1 F n + 1 F n + 2 = 1 where F n is the n th Fibonacci number and n ≥ 2 .
Thus 3 4 4 − 1 3 × 2 1 × 5 5 × 8 9 = 1