Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

I got B... Used the long approach List multiples of 36 Add 53 to them and compare result to answers

liftoff wrote:

I got B... Used the long approach List multiples of 36 Add 53 to them and compare result to answers

thisiszico2006 wrote:

Answer is B , but is there a generic formula or approach for this kind of problem instead of trail and error approach ?

U need to have an approach to solve this. Lets solve this logiccally

Here is the Approach Given that N=36k+23 Here k could be either odd or even. we got to find the reminder when 36 multiplied by a number, is divided by 72. So in the above equation K could be of odd or even numbers. give k values starting from 0 to 4

Case 1. When k=0 (36*0)+23 /72 gives reminder 23 Case 2. when k=1 (36*1)+23 /72 gives reminder 59.How we got59 is that-36/72gives reminder36.This 36+ 23=59. ) Case 3.when k= 2 (36*2)+23 /72 gives reminder 23 Case 4.When k=3 (36*3)+23 /72 gives reminder 59 So from this it can be understood that reminder can be either 23 or 59 based on the value of k if its even or odd. In the choice only 59 is given. So the answer is B 59 BINGO!!

_________________

If u think this post is useful plz feed me with a kudo

So the learning from this problem can be summarized below :

If a number "N" is divided by "D" and leaves a remainder "R" , then if that same number "N" is divided by "k*D" where "k" is a positive integer , then the number of remainders that are possible are R , D+R , 2D+R , .... , (k-1)D + R.

So if the question was that what is the remainder when the number was divided by 288 , we can approach it in a mechanical way.

The possible remainders are 23 , 36+23 , 72+23 , .... , 252+23 . We can straightaway reject answer choices that are not in this list.

Sample question : A number N divided by D gives a remainder of 7 , the same number divided by 5D gives a remainder of 24. Find D [N and D are both positive integers].

Ans: The possible remainder for the 2nd case are 7 , D+7 , 2D+7 , 3D+7 , 4D+7. So 7<> 24, case closed for 1st possibility , D+7 = 24 or D=17 (ok) 2D+7= 24, not ok as D cannot be fraction. 3D + 7=24, not ok as D cannot be fraction 4D+ 7 = 24, not possible as D cannot be fraction.

So possible values of D is only 17. So 17 must be present among the answer choices.

_________________

If Electricity comes from Electrons , Does Morality come from Morons ??

If you find my post useful ... then please give me kudos ......

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.