Banner 0
Banner 1
Banner 2
Banner 3
Banner 4
Banner 5
Banner 6

Q.

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


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

a

     21

b

      33

c

     36

d

     32 

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 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=bq+r,0r<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

Best Courses for You

JEE

JEE

NEET

NEET

Foundation JEE

Foundation JEE

Foundation NEET

Foundation NEET

CBSE

CBSE

score_test_img

Get Expert Academic Guidance – Connect with a Counselor Today!

whats app icon