1
Question
Use Euclid’s algorithm to find the H.C.F of 65 and 117.
Use Euclid’s algorithm to find the H.C.F of 65 and 117.
Open in App
Solution
The correct option is C 13
Step:1 Since 117 > 65 we apply the division lemma to 117 and 65 to get ,
117 = 65 x 1 + 52
Step:2 Since 52 ≠ 0 , we apply the division lemma to 65 and 52 to get
65 = 52 x 1 + 13
Step:3 Since 13 ≠ 0 , we apply the division lemma to 52 and 13 to get
52 = 13 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this Step is 13, the HCF of 117 and 52 is 13.
Step:1 Since 117 > 65 we apply the division lemma to 117 and 65 to get ,
117 = 65 x 1 + 52
Step:2 Since 52 ≠ 0 , we apply the division lemma to 65 and 52 to get
65 = 52 x 1 + 13
Step:3 Since 13 ≠ 0 , we apply the division lemma to 52 and 13 to get
52 = 13 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this Step is 13, the HCF of 117 and 52 is 13.
Suggest Corrections
0
Similar questions
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
