Derived these properties while solving a problem posted by Rohan in the math forum at RSA.

Generalized Fermat numbers Fn for a given integer a, Fn = a2n + 1

  1. Fn+1 - 2 = (Fn)(Fn - 2).
  2. Fn+1 = FnFn-1…F0(a - 1) + 2
  3. gcd(Fm, Fn) = 1 if a is even and 2 if a is odd, where m ≠ n.

No comments

Post a comment

RSS