use euclid's division algorithm to find HCF of 1290 and 228
Answers
Answered by
42
Solution :-
Euclid's Division Algorithm -
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.
Answer.
Euclid's Division Algorithm -
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.
Answer.
Answered by
6
Answer:
Step-by-step explanation:
Attachments:
Similar questions