Use the Euclidean Algorithm to find gcd(112,15)
follow the procedure shown in this simple video
http://www.youtube.com/watch?v=fwuj4yzoX1o
Use the Euclidean Algorithm to find gcd(112,15)
To find the greatest common divisor (gcd) of two numbers using the Euclidean Algorithm, you can follow these steps:
Step 1: Start with the two given numbers, in this case, 112 and 15.
Step 2: Divide the larger number by the smaller number and find the remainder.
112 ÷ 15 = 7 remainder 7
Step 3: Now, we take the divisor (15) and divide it by the remainder (7) obtained in the previous step.
15 ÷ 7 = 2 remainder 1
Step 4: Next, we repeat the process, taking the previous remainder (7) and dividing it by the current remainder (1).
7 ÷ 1 = 7 remainder 0
Step 5: Finally, we have obtained a remainder of 0, which means that the last non-zero remainder we obtained (1) is actually the gcd of the original numbers.
Therefore, the gcd(112, 15) is 1.
Note: The Euclidean Algorithm works by repeatedly dividing the larger number by the smaller number and replacing the larger number with the remainder obtained until the remainder becomes zero. The last non-zero remainder is the gcd of the original numbers.