If a prime $p$ divides a Fermat Number then $p=k\cdot 2^{n+2}+1$?
Does anyone know a simple/elementary proof?