use Euclid's algorithm to find
hcf196and38220
Answers
Answered by
1
Answer:
if you can dream it you can do it !
yes I am smiling because god is always teaching me to be strong
Answered by
0
Step-by-step explanation:
From Euclid's Division Algorithm,
=>38220 = 196×195+0
Since We got remainder as 0, so the divisor 38220 would be the HCF
Hope it helps, please mark as Brainliest
Similar questions