Ema Emits College Philippines: Greatest Common Divisor and Euclid's Algorithm
Ema Emits College Philippines: Greatest Common Divisor and Euclid's Algorithm
Number Theory
______________________________________________________________________________
Classical Greek mathematics concerned itself mostly with geometry. The notion of
measurement is fundamental to geometry, and the Greeks were the first to provide formal
foundation for this concept. Surprisingly, they never used fractions to express measurements
(and never developed an arithmetic of fractions). They expressed geometrical measurements
as relations between ratios. In numerical terms, these are statements like:
168 is to 120 as 7 is to 4
which we would write today as 168/120 = 7/5.
Statements such as (2,1) were natural to Greek mathematicians because they viewed
measuring as the process of finding a “common integral measure”. For example, we have:
168 = 24∙7
120 = 24∙5
so that we can use the integer 24 as a “common unit” to measure the numbers 168 and 120.
Going back to our example, notice that 24 is not the only common integral measure for
the integers 168 and 120, since we also have, for example, 168 = 6∙28 and 120 = 6∙20. The
number 24, however, is the largest integer that can be used to “measure” both 168 and 120,
and gives the representation in lowest terms for the ratio.
This motivates the following definition:
Definition 1.1. Let a and b are integers that are not both zero. Then, the greatest common
divisor (gcd) of a and b is the largest integer that divides both a and b, and is denoted by
gcd(a,b).
Second Method: Multiply the last digit by 4 and add it to the number formed by the
remaining digits. Repeat this process until you arrive at a smaller number whose
divisibility you know. If this smaller number is divisible by 13, then so is the larger
number. If this smaller number is not divisible by 13, then neither is the larger number.
Third Method: This is the same technique as for 7: Take the last three digits of the
number and subtract this from the number formed by the remaining digits. Repeat this
process until you end up with a number that has at most three digits. At that point you
may apply either the first method or the second method to check if the number is divisible
by 13.
TEST I: Answer the following questions. Show your solution at the back of the paper and write
the final answer on the space provided.
NOTE: NO SOLUTION, NO POINT!
1. Which of the following numbers are divisible by 2, 5 and 10? Please indicate if it is
divisible for 2, 5 or 10.
a) 149
b) 19400
c) 720345
d) 125370
e) 3000000
2. Check whether the numbers are divisible by 4. Write YES if it is divisible and NO if it is
not.
a) 23408
b) 100246
c) 34972
d) 150126
e) 846336
3. Is 9 a factor of the following? Write YES if it is divisible and NO if it is not.
1. 394683
2. 1872546
3. 5172354
4. 515712
5. 17218
4. Which of the two nearest numbers to 19506 are divisible by 9? Write your answers in
each letter.
a)
b)
5. Check using divisibility rules and fill in the boxes using YES or NO. Sample answer is
indicated for your guide.
Number By 2 By 3 By 4 By 5 By 6 By 7 By 8 By 9
a) 303 NO
b) 756
c) 1000
d) 8000
e) 1455 YES
Reference:
http://www.storyofmathematics.com/rules-of-divisibilty