Question

zula is trying to find the HCF Of 65 and 117 using Euclid's division of algorithm. in third step she get a divisor of 13. find the remainder at the end of the 3rd step?​

Answer 1

hope this answer will help !!!

Answer 2

Given: To find HCF of 65 & 117 using Euclid division algorithm.

To Find:

Remainder at the end of third step.

Solution:

HCF of 65 & 117.

Using Euclid division lemma

Step 1:

117 = 65×1 + 52

Step 2:

65 = 52×1 + 13

Step 3:

52 = 13×4 + 0

Hence, zero is the remainder in 3rd step.