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:
In Episode 7 of our GMAT Ninja CR series, we are rounding up the oddballs, the misfits, and the format-benders: EXCEPT, Fill-In-The-Blanks, and other unusual Critical Reasoning question types. When you see a question that ends with a literal blank line
For most test takers, Data Insights is the most challenging section on the GMAT, with test takers scoring several points lower on average on DI than on Quant or Verbal and completing the section with less time to spare.
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
when a number n is divided by 5 yeilds reminder 1 and when divided by 7 yeilds reminder 3.what is the least possible value of K so that K+n is divisible by 35.Please propose a simple solution for this
Ans: 4
Show more
First, understand the theory behind it. Then you can get to the answer within seconds.
Let us say I have a number n which is divisible by 5 and by 7. We all agree that it will be divisible by 35, the LCM of 5 and 7.
Now, if I have a number n which when divided by 5 gives a remainder 1 and when divided by 7 gives a remainder 1, we can say the number is of the form n = 5a + 1 e.g. 5 + 1, 10 + 1, 15 + 1, 20 + 1, 25 + 1, 30 + 1, 35 + 1 etc and n = 7b + 1 e.g. 7 + 1, 14 + 1, 21 + 1, 28 + 1, 35 + 1 etc So when it is divided by the LCM, 35, it will give 1 as remainder (as is apparent above)
Next, if I have a number n which when divided by 5 gives a remainder 1 and when divided by 7 gives a remainder 3, we can say the number is of the form n = 5a + 1 and n = 7b + 3 Now, the only thing you should try to understand here is that when n is divided by 5 and if I say the remainder is 1, it is the same as saying the remainder is -4. e.g. When 6 is divided by 5, remainder is 1 because it is 1 more than a multiple of 5. I can also say it is 4 less than the next multiple of 5, can't I? 6 is one more than 5, but 4 less than 10. Therefore, we can say n = 5x - 4 and n = 7y - 4 (A remainder of 3 when divided by 7 is the same as getting a remainder of -4) Now this question is exactly like the question above. So when you divide n by 35, remainder will be -4 i.e. n will be 4 less than a multiple of 35. So you must add 4 to n to make it a multiple of 35
A trickier version is: If I have a number n which when divided by 5 gives a remainder 1 and when divided by 7 gives a remainder 5, what is the remainder when n is divided by 35? n = 5a + 1 = 5x - 4 n = 7b + 5 = 7y -2 Nothing common! Now, I will need to check for the smallest such number. I put b = 1. n = 12. Is it of the form 5a + 1? No. Put b = 2. n = 19. Is it of the form 5a + 1? No. Put b = 3. n = 26. Is it of the form 5a + 1? Yes. When 26 is divided by 5, it gives a remainder of 1. When it is divided by 7, it gives a remainder if 5. Next such number will be 35 + 26. Next will be 35*2 + 26 and so on... The remainder when n is divided by 35 will be 26 (or we can say it will be -9). If we want to find the number that must be added to n to make it divisible by 35, that number will be 9.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
n is divided by 5 yeilds reminder 1 ---> n is short by 4 n is divided by 7 yeilds reminder 3 ----> n is short by 4 I think n is short by 4. So add 4 to make a whole i.e. a number divisible by 35.
when a number n is divided by 5 yeilds reminder 1 and when divided by 7 yeilds reminder 3.what is the least possible value of K so that K+n is divisible by 35.Please propose a simple solution for this
Ans: 4
Show more
Good question!
It would be great if you can post the answer choices and remove the text "Ans: 4" so that people can try out this question.
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.