Use Euclid's algorithm to find the HCF of 4052 and 12576
Answers
Answered by
1
Answer:
Sorrryyyy maiiiiii toooo bacchhaaa huuuuuuuu
Step-by-step explanation:
Mujheeee niiiiiiii aaaattttttaaaaaaaaaaa
Thanksssssssssss forrrrrrrrrrrrr theeeeeeeeeee pointssssssssssssssssssss
Answered by
1
Answer:
According to Euclid's Division Lemma if there
is two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 <= r <= b.
Attachments:
Similar questions