## 5.2 Outline

- Divisibility
- definition
- divisor
- factor
- divides
- multiple

- number of divisors
- divisibility rule for 2
- divisibility rule for 3
- rules of divisibility for 1-12

- finding primes
- definitions
- prime number
- composite number

- sieve of Eratosthenes

- definitions
- prime factorization
- factoring
- prime factorization
- fundamental theorem of arithmetic
- canonical form
- greatest common factor
- definition
- procedure for finding
- flowchart

- relatively prime
- least common multiple
- definition
- procedure for finding
- flowchart

- in pursuit of primes
- Mersenne prime
- largest known prime
- GIMPS

- infinitude of primes
- There is no largest prime.

- definition

## 5.2 Essential Ideas

This essential idea of this section is important to many concepts in mathematics, and that is the idea of a prime number: A prime number is a counting number that has exactly two divisors. A counting number that has more than two divisors is called a composite number.

This section begins with the notion of divisibility. Table 5.1 lists rules of divisibility for numbers from 1 to 12. In practice, however, we are looking for a prime factorization, so we are looking for prime divisors.

2 if the last digit is divisible by 2.

3 if the sum of the digits is divisible by 3.

5 if the last digit is 0 or 5.

We use prime numbers to find the prime factorization of numbers, and then use this idea to find the greatest common factor and the least common multiple. The greatest common factor is used to reduce fractions and the least common multiple is used to find the common denominator when adding or subtracting fractions. Some large primes are found and some possible formulas for primes considered, and then the section concludes by proving that there are infinitely many primes.