plz solve it fast ????
Attachments:
Answers
Answered by
4
Here is your answer....
Euclid’s Division is a method for finding the HCF (highest common factor) of two given integers. According to Euclid’s Division Algorithm, For any two positive integers, ‘a’ and ‘b’, there exists a unique pair of integers ‘q’ and ‘r’ which satisfy the relation:
a = bq + r , 0 ≤ r ≤ b
Given integers 196 and 38220. Clearly 38220>196.
By applying division lemma
⇒ 38220 = 196×195 + 0
Since remainder = 0
∴ the HCF of 196 and 38220 is 195.
hope it helps you.
Euclid’s Division is a method for finding the HCF (highest common factor) of two given integers. According to Euclid’s Division Algorithm, For any two positive integers, ‘a’ and ‘b’, there exists a unique pair of integers ‘q’ and ‘r’ which satisfy the relation:
a = bq + r , 0 ≤ r ≤ b
Given integers 196 and 38220. Clearly 38220>196.
By applying division lemma
⇒ 38220 = 196×195 + 0
Since remainder = 0
∴ the HCF of 196 and 38220 is 195.
hope it helps you.
simransaraswat30:
ok
no man it's a right answer.
196 is the right answer
no 195 is right answer
ok do multiply 196 ×195 = 38220
no
now is it clear
let it be
ok as u wish
yaa
Similar questions