Find the HCF of 1260 and 7344 by Euclid's division algorithm.

see full answer

High-Paying Jobs That Even AI Can’t Replace — Through JEE/NEET

🎯 Hear from the experts why preparing for JEE/NEET today sets you up for future-proof, high-income careers tomorrow.

An Intiative by Sri Chaitanya

answer is C.

(Unlock A.I Detailed Solution for FREE)

Best Courses for You

JEE

NEET

Foundation JEE

Foundation NEET

CBSE

Detailed Solution

Given,
The numbers are 1260 and 7344.
Let

a = 1260

and

b = 7344

,
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,

⇒ 7344 = 1260 × 5 + 1044

⇒ 1260 = 1044 × 1 + 216

⇒ 1044 = 216 × 4 + 180

⇒ 216 = 180 × 1 + 36

⇒ 180 = 36 × 5 + 0

Hence, the remainder is zero,
Thus, the HCF is 36.
Thus, the HCF of numbers 1260 and 7344 are 36.
Therefore, option(3) is correct answer.

Watch 3-min video & get full concept clarity

courses

No courses found

Result Producing online coaching for JEE/NEET of south India

Largest All India Test Series for JEE/NEET

Best Online Course for IIT JEE

Best Online Course for NEET

Best Online Course for CBSE

Ready to Test Your Skills?

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

Take Free Test

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 Online Course for IIT JEE

Best Online Course for NEET

Best Online Course for CBSE