Archive for the ‘ gmat ’ Category

Author: Ryan Ziemba Subject: Challenging Rate Problem – Help w/ Alternate Solution Posted: Fri Sep 03, 2010 8:47 pm (GMT -7) I found the example below in a Kaplan practice quiz and the only solution offered involves backsolving. Can anyone provide a mathematical solution? By the time backsolving occurred to me, I was already too deep into the math and resorted to poor guesswork.

Read more: 
Problem Solving :: Challenging Rate Problem – Help w/ Alternate Solution

Author: diebeatsthegmat Posted: Fri Sep 03, 2010 7:39 pm (GMT -7) David@VeritasPrep wrote: This is the question from OG Verbal Review 1 (from 2005) that I mentioned as being a very long stimulus with long and complicated answer choices. This is a difficult question it is number 82 out of 82 in that book. This question is not in the newest edition of the verbal review but a portion of this stimulus was transformed into an inference question (#56) in OG 12 edition.

View post: 
Critical Reasoning :: RE: Bold faced question from OG Verbal Review 1

Problem Solving :: RE: quadratic

Author: debmalya_dutta Posted: Fri Sep 03, 2010 7:03 pm (GMT -7) Gurpinder wrote: from the first equation X= 0 or -1/2 from the 2nd eqn , X = -1/2 or 3/2 common soln is -1/2 Hence B _________________ @Deb

Excerpt from: 
Problem Solving :: RE: quadratic

Author: Ian Stewart Posted: Fri Sep 03, 2010 5:46 pm (GMT -7) Yes, when you divide by an integer n, the only possible remainders are 0, 1, 2, 3, …, n-1. And when you divide each number in a set of n consecutive integers by n, you’ll get each of these remainders exactly once

View original post here:
Problem Solving :: RE: a question about remainders

Problem Solving :: a question about remainders

Author: mepinoargote Subject: a question about remainders Posted: Fri Sep 03, 2010 5:31 pm (GMT -7) When a possitive integer is divided by 7, the only possible remainders are 0,1,2,3,4,5 and 6. Also, each of these remainders will occur exactly once when the terms in a sequence of 7 consecutive integers are divided by 7. This is an explanation i got from OG about remainders, Can i generalize this rule when dividing a possitive integer by any n possitive integer

More here: 
Problem Solving :: a question about remainders

Problem Solving :: RE: inequality – og

Author: debmalya_dutta Posted: Fri Sep 03, 2010 5:13 pm (GMT -7) adding to it .. I could have said the answer is (202/201) * (1/s) …

Read more:
Problem Solving :: RE: inequality – og

Author: beatthegmatinsept Posted: Fri Sep 03, 2010 4:13 pm (GMT -7) diebeatsthegmat wrote: Is the product of all integers in a set S positive? a. The product of the smallest and greatest integers is positive

Originally posted here:
Data Sufficiency :: RE: a manhattan DS

Author: Wholio Posted: Fri Sep 03, 2010 4:04 pm (GMT -7) Thanks Stacey! Thats what I was thinking – I just needed someone to agree with me! I feel much less stressed out about my applications now knowing that I’ve got enough time to polish them.

Read more:
Ask an MBA Admissions Consultant :: RE: Which round should I apply in?

Author: Wholio Posted: Fri Sep 03, 2010 4:04 pm (GMT -7) Thanks Stacey! Thats what I was thinking – I just needed someone to agree with me! I feel much less stressed out about my applications now knowing that I’ve got enough time to polish them.

Continued here: 
Ask an MBA Admissions Consultant :: RE: Which round should I apply in?