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

Answer:

0

Step-by-step explanation:

Step 1. Divide the larger number by the smaller one:

117 ÷ 65 = 1 + 52;

Step 2. Divide the smaller number by the above operation's remainder:

65 ÷ 52 = 1 + 13;

Step 3. Divide the remainder from the step 1 by the remainder from the step 2:

52 ÷ 13 = 4 + 0;

At this step, the remainder is zero, so we stop:

13 is the number we were looking for, the last remainder that is not zero.

This is the greatest common factor (divisor).

Greatest (highest) common factor (divisor):

gcf, hcf, gcd (65; 117) = 13

gcf, hcf, gcd (65; 117) = 13;

I think u can understand well.

Answer 2

Given : Zula is trying to find the highest common factor of 65 and 117 using Euclid's Division Algorithm

she gets a divisor of 13

To Find :  the remainder at the end of 3rd step

Solution:

117  = 65 x 1  + 52

65  = 52 x  1   + 13

52  = 13 x 4   + 0

13 is the HCF

remainder at 3rd step is  0

Learn More:

find the hcf of 75 and 243 using Euclid division algorithm express in ...

https://brainly.in/question/9266837

Find the HCF of 125 and 1550 by using Euclid's division algorithm ...

https://brainly.in/question/18314389