Question

Use Euclid’s division algorithm to find the HCF of 1290 & 4228

Answer 1

Step-by-step explanation:

In mathematics, the Euclid's Division Algorithm is an efficient method to for computing the highest common factors (H.C.F.) of two numbers. 

H.C.F. of 1290 and 228, using Euclid's Division Algorithm :-

1290 = (228*5) + 150

228 = (150*1) + 78

150 = (78*1) + 72

78 = (72*1) + 6

72 = (6*12) + 0

Now, in the last the remainder is 0.

So, the H.C.F. of 1290 and 228 is 6.

Mark me as a brainlist thankyou