Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 32

LUISA JANE D.

AMBROCIO
DIVISIBILITY RULES
• Fortwo given integers and with
and there exists an integer such
that , we then say that divides or
is divisible by , written as . We
may also say that b is a multiple
of a or that a is a factor or divisor
of b.
does not divide , then we write .
•If 

This indicates that there exist


integers and such that where .
Example:
1) since
2) since
PROPERTIES
OF
DIVISIBILITY
•1. If and then
Ex. and then
2. If for any integer , then
Ex. , then =
3. For any integers , and and if and
then, and
Ex. and , then = also =
•4.  If and then=
5. For any integers and and if and , then
6. If and for any integers , , and , then
Ex. and then, or 18
RULES
OF
DIVISIBILITY
•Number
  divisible by 2
 The units digit (last digit) is or an
even number
Ex. 36
1,860
Number divisible by 3
 The sum of the digits is divisible by 3
Ex. 240 2+4+0 = 6 3|6, 3|240
•Number
  divisible by 4
 The last two digits form a number
divisible by 4 (or )
Ex. 932 32 4|32, 4|932
Number divisible by 5
 The units digit (last digit) is or 5
Ex. 75
10,890
•Number
  divisible by 6
 The number is divisible by both and
Ex. 852 last digit is 2,
, ∴ 3|852
Since and , then
Number divisible by 7
 Double the last digit. Subtract the doubled last
digit from the number without the last digit. If
the difference is a multiple of 7, then it is
divisible by 7.
Ex.
. Since , then
•Number
  divisible by 8
 The last three digits form a number
divisible by 8 or the last three digits
are zeros.
Ex. , Since , then
Number divisible by
 The sum of its digits is divisible by
Ex. Since , then
•Number
  divisible by
 The number ends in
Ex.
736,340
Number divisible by
 A. All the digits are the same and the
number of digits is even
Ex. but not
•B.
  If it is a 3-digit number, add the first and
last digits then subtract the middle digit. If the
difference is or , then the 3-digit number is
divisible by .
Ex.

 C. If the absolute value of the difference between


the sum of the digits in the odd positions and the
sum of the digits in the even positions is divisible
by 11
Ex.

Since , then
GENERAL RULE
 If a number is divisible by two
different prime numbers, then it is
divisible by the products of those
two numbers.

Ex. Since 36 is divisible by both 2 and


3, it is also divisible by 6.
PRIME NUMBERS
 Is a positive number which may only be
divided by 1 or itself. The first few prime
numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23
and 29. Numbers that have more than two
factors are called composite numbers.
SPECIAL CASE OF THE NUMBER 0
Zero cannot be a prime number because
every number is a factor of 0. Zero is not
composite number either.
SPECIAL CASE OF THE NUMBER 1
The number 1 is not prime nor
composite because it has only one
factor, not two different factors.
SPECIAL CASE OF THE NUMBER 2
• The number 2 is the only even prime. A
number m > 1 that is not a prime is
called composite.
To determine if a number is prime:
1. It must have only two possible,
unique factors (Both factors cannot be
the same).
2. One factor must be 1.
3. One factor must be a whole number
but not 0 or 1.
COPRIME
Is a set of two natural numbers
having no common factors other
than 1.
Example: 10 and 21
Proof: The factors of 10 are 1, 2, 5 and
10.
The factors of 21 are 1, 3, 7, and 21
Therefore, they are co-prime numbers
TWIN PRIME
Is a set of two prime numbers
having difference of 2.
Example: 5 and 7
Proof: 5 and 7 are prime numbers.
The difference of 5 and 7 is 2
Therefore, they are twin prime.
PRIME TRIPLETS
A set of three consecutive prime
numbers.
Example: 3, 5, 7
Proof: 3, 5, and 7 are prime
numbers.
They are consecutive numbers.
Therefore, they are prime triplets.
FACTORIZATION METHOD

•  PIERRE
DE FERMAT (1601-1665)
Founding Father of Number
Theory as a systematic size.
Undated letter of about 1643
probably addressed to Mersenne
(1588-1648)
1. Find the prime factors
•  

of 91.
Solution:
Step 1: Derive the formula
•  
Step 2: Find the value of
until you got a perfect
square.
•  
Step 3: Substitute the value
of
•  
Step 4: Substitute and
MERSENNE AND FERMAT PRIMES
• Considerableeffort has been
centered on the factorization of
numbers of particular types. Among
those numbers, we have the so-
called binomial numbers.

• MERSENNE PRIME
•  
MERSENNE PRIME

1. ; not prime
2. ; not prime
3. ; prime
FERMAT PRIME
 
•  

1. prime
2. ; prime
3. ; prime
• https://www.youtube.com/watch?v=Y1pAKJ4rf-M
• https://www.youtube.com/watch?v=CqrYYiffPr0
• https://www.youtube.com/watch?v=2WzcnnrTD3E

You might also like