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

see full answer

Start JEE / NEET / Foundation preparation at rupees 99/day !!

21% of IItians & 23% of AIIMS delhi doctors are from Sri Chaitanya institute !!

An Intiative by Sri Chaitanya

1759

1679

1543

1249

answer is B.

(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 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 = b q + r

where

0 ≤ r ≤ b

.
So, assume the number to be a.
Then by Euclid’s Division algorithm, we have,

a = b q + 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

tricks from toppers of Infinity Learn

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

🔥 Start Your JEE/NEET Prep at Just ₹1999 / month - Limited Offer! Check Now!

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