Events & Promotions
|
|
GMAT Club Daily Prep
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Jun 0308:30 AM PDT
-09:30 AM PDT
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
May 2910:00 AM IST
-11:00 PM IST
Start your journey with a fully customized action plan and work with a dedicated mentor to achieve a 735+ score.- Jun 04
08:30 AM PDT
-09:30 AM PDT
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. - Jun 10
06:00 AM PDT
-06:15 PM PDT
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..
16 Feb 2006, 19:29
Kudos
Bookmarks
Can any one explain how to find the ans. to these kind of questions:
I do not have the OA or OE
When a number N is divided by d1, the remainder is r1. When this number is divided by d2, the remainder is r2. What is the remainder when this number is divided by d1d2.
I do not have the OA or OE
When a number N is divided by d1, the remainder is r1. When this number is divided by d2, the remainder is r2. What is the remainder when this number is divided by d1d2.
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.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
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.
Thank you for understanding, and happy exploring!
17 Feb 2006, 08:38
Kudos
Bookmarks
believe2
i digged someting here: https://www.gmatclub.com/phpbb/viewtopic.php?t=17675
go to the attachments, banerjee managed to have something, though i couldnot proved his method/formula.
i believe, honghu should have better idea.
17 Feb 2006, 09:46
Kudos
Bookmarks
Professor
Thanks Professor, for researching and finding the link.
....but this example has got me even more confused.
Here is the text:
When a number is successively divided by two divisors d1 and d2 and two remainders r1 and r2 are obtained, the remainder that will be obtained by the product of d1 and d2 is given by the relation d1r2 + r1.
Where d1 and d2 are in ascending order respectively and r1 and r2 are their respective remainders when they divide the number.
In this case, the d1 = 8 and d2 = 11. And r1 = 3 and r2 = 7. Therefore, d1r2 + r1 = 8*7 + 3 = 59.
........in this example, if you try to do the reverse starting with 59 dividing it by either 8 or 11 whichever way, I don't see how you can get an r2=7
....I think I need some serious therapy now!!!
I'll work some more to see if I can get anything. But I agree it doesn't seem that the formula d1r2+r1 is correct.
