Amc Lecture 3

Download as pdf or txt
Download as pdf or txt
You are on page 1of 29

LECTURE 3

Dr. Hoang Thanh Nguyen

November 8, 2021

Dr. Hoang Thanh Nguyen LECTURE 3


Divisibility rules

1 A natural number is a multiple of 2 if and only if its units


digit is even.
2 A natural number is a multiple of 5 if and only if its units
digit is 0 or 5.
3 A natural number is a multiple of 10 if and only if its units
digit is 0.
4 A natural number is divisible by 3 if and only if the sum of its
digits is divisible by 3.
5 A natural number is divisible by 9 if and only if the sum of its
digits is divisible by 9 .
6 A natural number is divisible by 11 if and only if the
alternating sum of its digits is a multiple of 11.

Dr. Hoang Thanh Nguyen LECTURE 3


A natural number is a multiple of 4 if and only if the integer
formed by its last 2 digits is a multiple of 4.

A natural number is a multiple of 52 = 25 if and only if the integer


formed by its last 2 digits is a multiple of 25

Dr. Hoang Thanh Nguyen LECTURE 3


Divisibility rules with algebra

We sometimes face problems in which we know some of the


divisors of an integer, but not all of its digits.
Example
A is the tens digit of the integer 3A6. For what values of A is 3A6
a multiple of 9

Dr. Hoang Thanh Nguyen LECTURE 3


Dr. Hoang Thanh Nguyen LECTURE 3
Example
Find all possible ordered pairs (A, B) of digits that make 25A9B a
multiple of 36?

Dr. Hoang Thanh Nguyen LECTURE 3


Dr. Hoang Thanh Nguyen LECTURE 3
Example
Find all possible ordered pairs (A, B) of digits that make 67A7B a
multiple of 225?

Dr. Hoang Thanh Nguyen LECTURE 3


Dr. Hoang Thanh Nguyen LECTURE 3
Example
Problem .22, Exercsise 1

The 5-digit number 2 0 1 8 U is divisible by 9. What is the


remainder when this number is divided by 8?
1 1
2 3
3 5
4 6
5 7

Dr. Hoang Thanh Nguyen LECTURE 3


Dr. Hoang Thanh Nguyen LECTURE 3
Similar problems: Problem 2.12, Problem 2.18, Problem 2.34,
Problem 2.38.

Dr. Hoang Thanh Nguyen LECTURE 3


Definition
A prime number (or simply prime) is a natural number p > 1
where only positive divisors are 1 and p.

Dr. Hoang Thanh Nguyen LECTURE 3


Prime Factorization

A Factor tree is a visual chart that shows a step-by-step process of


breaking an integer down into a product of primes.

Primes are very special numbers. Primes are the only integers that
cannot be broken down into a product of two smaller integers.

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Express 12 as a product of only prime numbers.
We begin by finding smallest prime divisor of 12.

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Express 20 as a product of only prime numbers.

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Express 30 as a product of only prime numbers.

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Express 63 as a product of only prime numbers.

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Express 63 as a product of only prime numbers.

Dr. Hoang Thanh Nguyen LECTURE 3


lcm

Example
Find lcm[12, 45]
Let’s start with the prime factorizations of 12 and 45.

We underline the largest exponent of each prime in either of the


prime factorizations of the integers.

lcm[12, 45] = 22 32 5 = 180

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Use the prime factorization of 9, 15, and 24 to find lcm[9, 15, 24]

Dr. Hoang Thanh Nguyen LECTURE 3


GCD

Example
Find GCD(42, 60)
We begin by examnining the prime factorizations of 42 and 60

Underline the smallest exponent of each prime in either of the


prime factorization of the integers

GCD(42, 60) = 21 31 = 6

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Find GCD(36, 84)

Dr. Hoang Thanh Nguyen LECTURE 3


Counting divisors

Example
Find all of the positive divisors of 200
200 = 23 52 .

A divisor of 200 can only have prime divisors of 2 and 5. This


means that we can express any positive divisor of 200 in the form

2a 5b

where a ∈ {0, 1, 2, 3} and b ∈ {0, 1, 2}

There are 4 possible values for a and 3 possible values for b. Hence

4 × 3 = 12

Dr. Hoang Thanh Nguyen LECTURE 3


Example
Find all of the positive divisors of 192

Dr. Hoang Thanh Nguyen LECTURE 3


In general: Let n be a natural number with prime factorization

n = p1e1 p2e2 · · · pm
em

The the number of positive divisors of n is

(e1 + 1)(e2 + 1) · · · (em + 1)

Dr. Hoang Thanh Nguyen LECTURE 3


Similar problem: Problem 2.23

Dr. Hoang Thanh Nguyen LECTURE 3


Find the smallest positive integer which when divided by 10 leaves
a remainder of 9, when divided by 9 leaves a remainder of 8, by 8
leaves a remainder of 7, etc, ...down to where, when divided by 2,
it leaves a remainder of 1.

A) 2519
B) 2520
C) 2521
D) 2522

Dr. Hoang Thanh Nguyen LECTURE 3


Similar problems: Problem 2.19, Problem 2.24, Problem 2.42,
Problem 2.56

Dr. Hoang Thanh Nguyen LECTURE 3

You might also like