Math 2.0

statement corollary

Lcm of coprime integers

Statement

Let aa and bb be natural numbers that are coprime. Then lcm⁡(a,b)=ab\operatorname{lcm}(a, b) = a b.

Remarks

This follows from the product of the gcd and the lcm, because gcd⁡(a,b)=1\gcd(a, b) = 1. The converse is also true when aa and bb are positive: if lcm⁡(a,b)=ab\operatorname{lcm}(a, b) = a b, then aa and bb are coprime. For example, lcm⁡(8,15)=120\operatorname{lcm}(8, 15) = 120.

Explanations

L1 human

When aa and bb have no common factor, a multiple of both must contain all the factors of aa and all the factors of bb. No factor can serve both numbers at the same time, so the smallest common multiple is aba b.

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Greatest common divisor definition
  3. Least common multiple definition
  4. Coprime integers definition
  5. Product of the gcd and the lcm statement
  6. Lcm of coprime integers statement

Sources

  1. Web https://en.wikipedia.org/wiki/Least_common_multiple, Using the greatest common divisor