Question

Use Euclid's division algorithm to find the HCF of:
(i) and (ii) and (iii) and
Find the highest HCF among them.

Medium
Solution
verified
Verified by Toppr
Correct option is A)


(i) By Euclid's division lemma,
So,H.C.F of and is

(ii) By Euclid's division lemma,
So, H.C.F of and is

(iii) By Euclid's division lemma, 
So, H.C.F of and is

The highest HCF among the three is .

Solve any question of Real Numbers with:-
Was this answer helpful?
upvote 0
downvote0