Question
Use Euclid's division algorithm to find the HCF of:
196 and 38220

Answer

Given integers are 38220 and 196.
Clearly 38220 > 196. So we will apply Euclid’s division lemma to 38220 and 196, we 38220 = (196)(195) + 0 get,
The remainder at this stage is 0. So the divisor at this stage is the H.C.F.
So the H.C.F of 38220 and 196 is 196.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free