Banner 0
Banner 1
Banner 2
Banner 3
Banner 4
Banner 5
Banner 6
Banner 7
Banner 8
Banner 9

Q.

Find the greatest integer that divides 1251, 9377, and 15628 with remainders of 1, 2, and 3, respectively, using Euclid's division algorithm.


see full answer

Your Exam Success, Personally Taken Care Of

1:1 expert mentors customize learning to your strength and weaknesses – so you score higher in school , IIT JEE and NEET entrance exams.
An Intiative by Sri Chaitanya

a

450

b

200

c

625

d

125 

answer is C.

(Unlock A.I Detailed Solution for FREE)

Best Courses for You

JEE

JEE

NEET

NEET

Foundation JEE

Foundation JEE

Foundation NEET

Foundation NEET

CBSE

CBSE

Detailed Solution

Given that the remainders of 1251, 9377, and 15628 are 1, 2, and 3, respectively.
So, we will subtract the remainders from the given numbers.
12511=1250 93772=9375,  
156283=15625.  
To find the HCF of 15625, 9375, and 1250.
First, we will obtain the HCF of two numbers i.e. 15625 and 9395 by using Euclid’s division algorithm.
15625=9375×1+6250 9375=6250×1+3125 6250=3125×2+0  
Therefore, HCF 15625,9375 =3125.  
Now, we will obtain the HCF of 3125 and 1250 by using Euclid’s division algorithm.
3125=1250×1+625 1250=625×2+0  
∴ HCF 1250,9375,15625 =625  
Hence, the correct option is 3.
 
Watch 3-min video & get full concept clarity
score_test_img

courses

No courses found

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!

best study material, now at your finger tips!

  • promsvg

    live classes

  • promsvg

    progress tracking

  • promsvg

    24x7 mentored guidance

  • promsvg

    study plan analysis

download the app

gplay
mentor

Download the App

gplay
whats app icon
personalised 1:1 online tutoring