statement corollary
Lcm of coprime integers
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, .
Explanations
L1 human
When and have no common factor, a multiple of both must contain all the factors of and all the factors of . No factor can serve both numbers at the same time, so the smallest common multiple is .
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.
- 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
Sources
- Web https://en.wikipedia.org/wiki/Least_common_multiple, Using the greatest common divisor
What links here
No node links to this node yet.