Ononot — Let Fn = 2^{2^n} + 1. What is \text{gcd}(Fn, Fm) for n < m?

Guest Session: 1 Question Remaining. Create Account to save progress.

GCD & LCMhard

0:00.0

Let $F_n = 2^{2^n} + 1$ . What is $\text{gcd}(F_n, F_m)$ for $n < m$ ?