NUMBER THEORY Theorem.

For positive integers 𝑎 and 𝑏:

𝑎𝑏
Least Common Multiple (Lcm) [𝑎, 𝑏] =
(𝑎, 𝑏)

Another equally important concept, like the greatest common Corollary. For any given two integers 𝑎 and 𝑏,
divisor, is the least common multiple of the given integers. [𝑎, 𝑏] = 𝑎𝑏 iff (𝑎, 𝑏) = 1

Example: Find the 𝐿𝐶𝑀 of 12 and 18. EXAMPLES: Find the 𝑙𝑐𝑚 of the following.
Let 𝑀12 = set of multiples of 12
𝑀18 = set of multiples of 18 1. [72, 48]
2. [1110,550]
Subsequently, 𝑀12 = {12, 24, 36, 48, 60, 72, … } 3. [36, 88, 40]
𝑀18 = {18, 36, 54, 72, … } 4. [120, 150, 75]

Then the set of common multiples of 12 and 18 is {36, 72, … } but the
least common multiple of 12 and 18 is 36. Therefore 36 is the 𝑙𝑐𝑚.
Def. Given integers 𝑎 and 𝑏. Then the 𝑙𝑐𝑚 of a 𝑎 and 𝑏 is the
positive integer denoted by 𝑚 = [𝑎, 𝑏], satisfying the following
conditions:
a. If 𝑎│𝑚 and 𝑏│𝑚
b. If 𝑎│𝑛 and 𝑏│𝑛, then 𝑚 ≤ 𝑛
THE SIEVE OF ERATOSTHENES
The Sieve of Eratosthenes is a method for finding all primes up to
(and possibly including) a given natural 𝑛. This method works well
when 𝑛 is relatively small, allowing us to determine whether any
natural number less than or equal to 𝑛 is prime or composite.
We now explain how the Sieve of Eratosthenes can be used to find all
prime numbers up to a given natural number. Recall that 𝑎 is a
multiple of 𝑏 means that 𝑏 divides 𝑎.

The following are the immediate consequences of the definitions.

Strategy. Sieve of Eratosthenes. To find all prime numbers up to a
a. (𝑎, 𝑏) ≤ [𝑎. 𝑏] given integer 𝑛 we proceed as follows.
b. [𝑎, 𝑏] = [−𝑎, 𝑏] = [𝑎, −𝑏] = [−𝑎, −𝑏]
a. Write a number from 1 to 100
Theorem. For any integer 𝑎 and 𝑏. Then [𝑎. 𝑏] = 𝑚 > 0 if and only if
b. 1 is not prime.
the following are satisfied.
c. Cross out all multiples of 2
i. If 𝑎│𝑚 and 𝑏│𝑚 d. Cross out all multiples of 3
ii. If 𝑎│𝑛 and 𝑏│𝑛, then 𝑚│𝑛 e. Cross out all multiples of 5
f. Cross out multiples of 7
g. Then everything not crossed is prime.