Lcm of coprime integers
Builds on Coprime integersLeast common multipleProduct of the gcd and the lcm
Statement
Let and be natural numbers that are coprime. Then .
Remarks
This follows from the product of the gcd and the lcm, because . The converse is also true when and are positive: if , then and are coprime. For example, .
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Greatest common divisor definition
- Least common multiple definition
- Coprime integers definition
- Product of the gcd and the lcm statement
- Lcm of coprime integers statement
Further reading
- Web https://en.wikipedia.org/wiki/Least_common_multiple, Using the greatest common divisor
About this page
| Tag | 07CZYE06ZJ |
|---|---|
| URI | m2://07CZYE06ZJ |
| Kind | statement, corollary |
| Writing | W0 stub |
| MSC | 11A05 |
| Status | This copy of the site has no build data. Run m2 status 07CZYE06ZJ. |
| Uses | Coprime integers, Least common multiple, Product of the gcd and the lcm |
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.