Scribd
Upload
442 views

DIVISIBILITY

This document discusses divisibility rules and properties. It defines divisibility and provides rules for determining if a number is divisible by 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and 13 without performing long division. It also covers the division algorithm, greatest common divisor (GCD), prime numbers, and algorithms for calculating GCD like the Euclidean algorithm.

Uploaded by

Billy Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
442 views

DIVISIBILITY

This document discusses divisibility rules and properties. It defines divisibility and provides rules for determining if a number is divisible by 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and 13 without performing long division. It also covers the division algorithm, greatest common divisor (GCD), prime numbers, and algorithms for calculating GCD like the Euclidean algorithm.

Uploaded by

Billy Cruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

DIVISIBILITY

•Let
  and be integers with . Suppose for some integer
c. We then say or written as . We may also say that
or

If , we write
Exercises:
•Determine
  whether , if it divides then find .
Properties of Divisibility
•i.   If and , then .
ii. If then for any integer x, .
iii. If and , then and .
iv. If and , then .
v. If and if and only if
vi. If , then
vii. If and , then for arbitrary integers x and y.
DIVISIBILITY RULES

• Divisibility are ways of quickly determining factors


without having perform a complete division
DIVISIBILITY RULES
DIVISIBLE BY 2
An integer is divisible by 2 if the last digit is even
EX. 18,564 is divisible by 2 because the last digit which is 4 is even
DIVISIBLE BY 3
An integer is divisible by 3 if the sum of the digits of the number is divisible
by 3.
Ex. 186,585 is divisible by 3 because 1+8+6+5+8+5=33 and 33 is divisible 3.
DIVISIBILITY BY 4
An integer is divisible 4 if the last two digits form a number that is divisible by
4.
Ex. 65,524 is divisible by 4 because the last two digits (24) is divisible by 4.
DIVISIBILITY BY 5
An integer is divisible by 5 if the last digit is either 0 or 5.
Ex. 215,460,535 is divisible by 5 because the last digit is 5.
DIVISIBILITY RULES
DIVISIBILITY BY 6
An integer is divisible by 6 if it is even number and divisible by 3.
Ex. 634128 is divisible by 6 because
634128 is an even number and 6+3+4+1+2+8 = 24 and 24 is divisible by 3.
DIVISIBILITY BY 7
An integer is divisible by 7 if the difference of 2 times the unit digit and the number formed b
the remaining digits is divisible by 7.
Ex. 3983: 3x2=6
398 – 6 = 392 repeat the process
392: 2x2 = 4
39 – 4 = 35
Since 35 is divisible by 7, therefore 3983 is divisible by 7.
DIVISIBILITY BY 8
An integer is divisible by 8.
Ex. 64912 is divisible by 8 because the last 3 digits 912 is divisible by 8.
DIVISIBILITY BY 9
An integer is divisible by 9 if the sum of its digits is divisible by 9.
Ex. 845721 is divisible by 9 because 8+4+5+7+2+1=27 and 27is divisible by
9
DIVISIBILITY BY 10
An integer is divisible by 10 if the last digits is 0
Ex. 2465760 is divisible by 10 because the last digit is 0.
DIVISIBILITY BY 11
A number is divisible by 11 if the difference of the sum of the even placed
digits and the sum of the odd-placed digits is divisible by 11
Ex. 28193 sum of odd – placed digits 2+1+3 = 6 and sum of even – placed
8+9=17 their difference 17-6 = 11 and 11 is divisible by eleven. Hence
28193 is divisible by 11.
DIVISIBILITY BY 12
An integer is divisible by 12 if he number is divisible by 3 and 4.
Ex. 42,163,284 is divisible by 3 since the sum of the digits (4+2+1+6+3+2+8+4 = 30) 30
is divisible by 3. Also 42,163,284 is divisible by 4, since 84, the last 2 digits is divisible
by 4. Therefore, 42,163,284 is divisible by 12.
DIVISIBILITY BY 13
An integer is divisible by 13 if the sum of four times the unit digits and the number
formed by the remaining digits is divisible by 13.
Ex. 69,238: 4x8 = 32
6923 + 32 = 6955 repeat the process
6955: 4x5=20
695 + 20 = 715
715; 4x5 = 20
71 + 20 = 91
91; 4x1 = 4
9 + 4 = 13
Since 13 is divisible by 13, therefore, 69238 is divisible by 13.
Exercises
1. The number a457 is divisible by 3. Find the value
of a.
2. If the number 56b714 is divisible by 6, find the
value of b.
3. The number 54a21b8 is divisible by 6. Find all the
possible combination of a and b.
Division Algorithm
• 
Theorem:
Let and be integers with . Then there exists integers q and r such that:
and

Also integers q and r are unique.


The integer:
• q is called the quotient
• r is called the remainder
• b is called the divisor
• is called the dividend

The theorem also states that

Note: Look for the proof of existence and uniqueness in the theorem above.
Illustration
•1.  Let and , find q and r.
2. Let and find q and r.
3. Let and find q and r.
4. Let and find q and r.
5. When the number is divided by 7, the quotient is
21 and the remainder is 5. Find the number.
5. How many three digit numbers are divisible by 6?
Division Algorithm using a
Calculator
•1.  Find .
2. Let q be the integer part ()
3. Let r be the difference between and
(
Divisibility and Primes
Properties of Divisibility
•i.   If and , then .
ii. If then for any integer x, .
iii. If and , then and .
iv. If and , then .
v. If and if and only if
vi. If , then
vii. If and , then for arbitrary integers x and y.
Examples
•1)  Clearly, 3/6 since 3(2)=6 and -4/28 since -4(7)=28.
2) The divisors of 4 are
3) If then since
4) Every integer is divisible by . These are
sometimes called the trivial divisors of .
Primes
•A  positive integer is called a prime number or a
prime if its only divisors are and , that is, if p only has
trivial divisors.

If is not prime, then n is said to be composite, that


is, where .
Example
1) The integers 2 and 7 are primes, whereas 6 and 15
are composite.
2) Primes less than 50:
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47
3. Although 21, 24 and 1729 are not primes, each can
be written as a product of primes.
Theorem
•Every
  integer can be written as a product of primes.
Theorem
There is no largest prime, that is, there exists an
infinite number of primes
Exercises
1. Don and Edna each choose a different prime
number less than 50 and multiply there numbers
together. What is the largest product that could
be made from their two numbers?
2. Al, Bob and Cindy each choose any of the prime
numbers 2, 3 or 5. There numbers are then
multiplied together. How many different products
can there be?
Greatest Common Divisor (GCD)
•Suppose
  and are integers, not both 0. An integer d is
called a common divisor of and if d divides and , that
is and .
Note that 1 is a positive common divisor of and and
that any common divisor cannot be greater than . Thus
there exists a largest common divisor of and , it is
denoted by

and it is called the greatest common divisor of a and b.


Example
•1)  The common divisors of 12 and 18 are . Thus gcd
(12, 18)=6.
2) 4
3) For any integer , we have
4) For any prime p, we have or according as p does
or does not divide .
5) Suppose is positive. Then if and only if
Theorem(GCD)
•A  positive integer if and only if d has the following
two properties:
1)
2) If c divides both , then .
Simple properties of gcd:
• 
1) If then
2) If
3) For any integer x,
Euclidean Algorithm
•   By recursive use of the division algorithm, we may
find the greatest common divisor of two positive
integers and , without factoring either. This
procedure is also known as Euclidean Algorithm.
Euclidean Algorithm Process
•To  compute we need to use the repeated division
algorithm to obtain a decreasing sequence of
positive integers ; that is
Example
•1.  Use the Euclidean Algorithm to find the
2. Find the .
Exercises
•A.  For each of the following pairs of integers use
Euclidean Algorithm to find
Bezout’s Theorem
•Any
  nonzero integers have a greatest common divisor, which
can be expressed as a linear combination of

Reverse Euclidean Algorithm

Where x and y are integers


Example
1. Find the gcd (435, 377) and express it as a linear
combination of 435 and 377.
2. Find the gcd (405, 480) and express it as a linear
combination of 405 and 480.

You might also like