Math 2.0

definition

Least common multiple

Definition

Let aa and bb be nonzero integers. A common multiple of aa and bb is an integer mm such that a∣ma \mid m and b∣mb \mid m. The least common multiple lcm⁡(a,b)\operatorname{lcm}(a, b) is the smallest positive common multiple of aa and bb. By convention, lcm⁡(a,0)=lcm⁡(0,a)=0\operatorname{lcm}(a, 0) = \operatorname{lcm}(0, a) = 0 for each integer aa.

Remarks

The positive integer ∣ab∣|a b| is a common multiple, so lcm⁡(a,b)\operatorname{lcm}(a, b) exists and lcm⁡(a,b)≤∣ab∣\operatorname{lcm}(a, b) \le |a b|. Each common multiple of aa and bb is a multiple of lcm⁡(a,b)\operatorname{lcm}(a, b). For example, lcm⁡(4,6)=12\operatorname{lcm}(4, 6) = 12. The product of the gcd and the lcm is the product of the two numbers.

Explanations

L1 human

List the positive multiples of each number, and take the smallest number that is in both lists. The multiples of 44 are 4,8,12,16,…4, 8, 12, 16, \dots and the multiples of 66 are 6,12,18,…6, 12, 18, \dots. Thus lcm⁡(4,6)=12\operatorname{lcm}(4, 6) = 12. You use this number when you add 14+16\tfrac{1}{4} + \tfrac{1}{6} with a common denominator.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 2 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. Least common multiple definition

What depends on this

3 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Least_common_multiple, lead section