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

Q.

Find the number which when divided by 61 gives 27 as quotient and 32 as remainder.


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

1759

b

1679 

c

1543

d

1249 

answer is B.

(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 when 61 is divided by a number it gives 27 as quotient and 32 as remainder.
As per the Euclid’s Division algorithm, for any two positive integers say ‘a’ and ‘b’, two unique whole numbers say ‘q’ and ‘r’ exist such that a=bq+r where 0rb .
So, assume the number to be a.
Then by Euclid’s Division algorithm, we have,
a=bq+r ………. (i)
 Now, as per the given condition, we have b = 61, q = 27 and r = 32.
Substituting these in equation (i) and simplifying, we get
a=61×27+32 a=1647+32 a=1679
So, the required number is obtained as 1679.
Hence, the correct option is (2).
 
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