bridge hands and math and computer science and programming and puzzles and etc and etc.
Show that F is a fibonacci number if and only if 5F2±4 is a perfect square.
i.e if one of 5F2+4 or 5F2−4 is a perfect square, then F is fibonacci and vice-versa.