OurBigBook About$ Donate
 Sign in Sign up

Distinct Fermat numbers are coprime (gcd(Fm​,Fn​)=1(m=n))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Fermat number Fermat number product identity
2026-10-14  0 By others on same topic  0 Discussions Create my own version
If m<n, a common divisor of Fm​ and Fn​ divides both Fn​−2, by the Fermat number product identity, and Fn​. It therefore divides two. Both Fermat numbers are odd integers, so their greatest common divisor is one. Each term's prime factors are consequently different from the prime factors of every other term.

 Ancestors (6)

  1. Fermat number product identity
  2. Fermat number
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook