Math, asked by rudrapartap7446, 7 months ago

Rani is trying to find the highest common factor of 418 and 33 using Euclid division algorithm (EDA). in their 3rd step she get a divisor of 11. find the remainder at the end of 3rd step.​

Answers

Answered by gnishagng
3

it will be 0

Step-by-step explanation:

418 and 33

418=33×12+22

33=22×1+11

22=11×2+0

therefore, inthe 3rd step we will get 0

Similar questions