Question

Zula is trying to find the highest common factor of 656565 and 117117117 using Euclid's Division Algorithm (\text{EDA})(EDA)left parenthesis, start text, E, D, A, end text, right parenthesis.
In her 3^{\text{rd}}3
rd
3, start superscript, start text, r, d, end text, end superscript step, she gets a divisor of 131313.
Find the remainder at the end of 3^{\text{rd}}3
rd
3, start superscript, start text, r, d, end text, end superscript step​

Answer 1

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