Question

Kanta is trying to find the highest common factor of 42 and455 using Euclid's division algorithm.
In her 3rd step ,she gets a divisor of 7.
Find the remainder at the end of 3 rd step

Answer 1

Answer:

Zero

Step-by-step explanation:

455 = 45×10+35

45= 35×1 +7

35=7×6+0

7 is divisor and

Remainder is 0

and HCF is 7