Fermat numbers are pairwise coprime
Builds on Fermat numberCoprime integers
Statement
Let and be distinct natural numbers. Then the Fermat numbers and are coprime.
Remarks
The proof uses . A common divisor of and with divides . Fermat numbers are odd, so the divisor is . The result is often called Goldbach's theorem, after Christian Goldbach. A consequence is a new proof that there are infinitely many primes: each has a prime factor, and these primes are all distinct.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Fermat number definition
- Greatest common divisor definition
- Coprime integers definition
- Fermat numbers are pairwise coprime statement
Further reading
- Web https://en.wikipedia.org/wiki/Fermat_number, Basic properties
About this page
| Tag | 05598J0Y8R |
|---|---|
| URI | m2://05598J0Y8R |
| Aliases | goldbach-theorem-fermat-numbers |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11A41 |
| Status | This copy of the site has no build data. Run m2 status 05598J0Y8R. |
| Uses | Fermat number, Coprime integers |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.