assume p=k*2^n+1 is a divisor of a Fermat number F(m).

if k is a perfect square then n-m>2