Using Euclid's division algorithm, find the HCF of the numbers 466 and 361 .

see full answer

Talk to JEE/NEET 2025 Toppers - Learn What Actually Works!

Real Strategies. Real People. Real Success Stories - Just 1 call away

An Intiative by Sri Chaitanya

answer is C.

(Unlock A.I Detailed Solution for FREE)

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

Detailed Solution

Given,
The numbers are 466 and 361.
Let

a = 466

and

b = 361

,
Now as we know,
Euclid division lemma states that if we have two numbers a and b, then there exist unique integers p and q which satisfies the condition

a = b q + r, 0 ≤ r < b

.
Using Euclid division lemma algorithm, we get,

⇒ 466 = 361 × 1 + 105

⇒ 361 = 105 × 3 + 46

⇒ 105 = 46 × 2 + 13

⇒ 46 = 13 × 3 + 7

⇒ 13 = 7 × 1 + 6

⇒ 7 = 6 × 1 + 1

⇒ 6 = 1 × 6 + 0

⇒ H C F = 1

Therefore H.C.F of 466 and 361 is 1.
Therefore, option(3) is correct answer.

Result Producing online coaching for JEE/NEET of south India

Largest All India Test Series for JEE/NEET

Best Books for IIT JEE

Best Books for NEET

How to Join IIT after 10th

Best Courses for You

JEE

NEET

Foundation JEE

Foundation NEET

CBSE

Get Expert Academic Guidance – Connect with a Counselor Today!

Result Producing online coaching for JEE/NEET of south India

Largest All India Test Series for JEE/NEET

Best Books for IIT JEE

Best Books for NEET

How to Join IIT after 10th