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.
It appears that you are browsing the GMAT Club forum unregistered!
Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club
Registration gives you:
Tests
Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.
Applicant Stats
View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more
Books/Downloads
Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!
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:
Ian, Please correct me. In GMAT neither statements contradict. So its good idea to take the hint from 2) statement. Solve for the value of stamps using 1) and 2) x=y and 15x + 29y = 440. Hence x=y=10
Yes, since the Statements never contradict each other, you can be sure from Statement 2 that there must be one solution where x=y, even when you only use Statement 1 alone. The only question then is whether there might be a second solution.
gmat1220 wrote:
Now suspect if 1) ALONE is the "credited" answer. To prove that no other solution exists just put in random integer < 10 and random integer > 10 for x, y in the equation 15x + 29y = 440. In choosing x and y, I know for sure if x > 10 then y < 10 and vice versa. If I get more than one pair of solution, the answer is C otherwise it is A.
No, I would not just haphazardly plug in all conceivable values of y here to see which work; that would take a long time. We have an equation involving positive integers:
15x + 29y = 440
Now, two of the numbers (15 and 440) are multiples of 5. That guarantees that the third number, 29y, is also a multiple of 5, and so y must be a multiple of 5 (if it is not immediately clear that 29y needs to be a multiple of 5 here, you can rewrite the equation as 29y = 440 - 15x = 5(88 - 3x), from which we can see that 29y is equal to a multiple of 5). Doing this you greatly cut down on the number of values you need to test; you now only need to check y= 5, 10 and 15 (since if y = 20, the sum is too large). _________________
GMAT Tutor in Toronto
If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com
Joanna bought only $0.15 stamps and $0.29 stamps. How many $0.15 stamps did she buy? (1) She bought $4.40 worth of stamps. (2) She bought an equal number of $0.15 stamps and $0.29 stamps.
Let \(x\) be the # of $0.15 stamps and \(y\) the # of $0.29 stamps. Note that \(x\) and \(y\) must be an integers. Q: \(x=?\)
(1) She bought $4.40 worth of stamps --> \(15x+29y=440\). Only one integer combination of \(x\) and \(y\) is possible to satisfy \(15x+29y=440\): \(x=10\) and \(y=10\). Sufficient.
(2) She bought an equal number of $0.15 stamps and $0.29 stamps --> \(x=y\). Not sufficient.
Answer: A.
So when we have equation of a type \(ax+by=c\) and we know that \(x\) and \(y\) are non-negative integers, there can be multiple solutions possible for \(x\) and \(y\) (eg \(5x+6y=60\)) OR just one combination (eg \(15x+29y=440\)). Hence in some cases \(ax+by=c\) is NOT sufficient and in some cases it is sufficient.
I hate C traps!!The good news is that both statements do no contradict each other. So, I know that the 2nd statement provides a clue, even if it is not sufficient on its own. And, from the numbers given( 0.15, 0.29 and 4.40), I look for some sort of relationship among them. In this case, the number should be a multiple of 5 in order to give a 0 in 4.40. And, 0.15 + 0.29 =0.44. Sometimes the solution is so obvious that I cant see it even if it is staring straight at me....sigh..
start with zero 29 cent stamps and subtract it from 4.40
in this particular case, I belieeve, we can't start with zero 29 cent stamps, we should start with 1, because stimulus says Jonna bought both kind of stamps. _________________
C is a trap. I hate these questions, because you have to work out the possibilities. Is there a simpler way to determine if (A) only has one solution? I usually just draw a little chart and start filling it in.
Only in statement 1. You should not use the information from statement 1 unless you are considering to combine both statement 1 and statement 2 to arrive at answer C. _________________
Diophantine Equations related Data Sufficiency. [#permalink]
16 Jun 2013, 16:32
2
This post received KUDOS
2
This post was BOOKMARKED
Here is the method to never fail to answer correctly Diophantine-equations-related Data Sufficiency problems.
1. First, be sure that the 2 variables must be non-negative integers or positive integers and that each statement provides a linear equation relating the 2 variables. Furthermore, be sure that the 2 equations are not equivalent (2x+3y=20 and 6x+9y=60 are equivalent) and are reduced to the form: ax + by = c whith integral coefficients and constant term such that GCF (a,b)=1.
2. Find an initial Solution: "Take advantage" of the fact that statements never contradict each other and thus system of equations constructed with both statements have always at least one solution. So resolve the system of equations.
3. Unicity: Once you arrive to a solution, say (x0, y0), go back to the first statement alone, for example, and check the unicity of the solution using only that statement by applying the test below. In case the solution is unique, statement 2 is superfluous and statement 1 is sufficient. The answer is A or D. In case the solution is not unique the answer is B, C or E.
Apply the test on statement (2). And update your answer.
If there is more than one solution using each statement alone then the answer is C.
------------------------------------------------------------------------------------------------------------------------------------------------- Now here is the rule that indicates whether or not a non-negative integer solution is unique to an equation: Suppose the equation be: ax+by=c (reduced with a, b, c positive integers. i.e. GCF(a,b)=1) If (x0-b)<0 AND (y0-a)<0 then there is no other non-negative integer solution than (x0, y0) and the corresponding statement is sufficent. If (x0-b)>=0 OR (y0-a)>=0 then other non-negative integers solutions exist and the statement is not sufficient.
If the variables must be positive the test is: If (x0 - b)<=0 AND (y0 - a)<=0 then there is no other positive integer solution than (x0, y0) and the corresponding statement is sufficent. If (x0 - b)>0 OR (y0 - a)>0 then other positive integers solutions exist and the statement is not sufficient.
Note: The test is to subtract each coefficient from the solution found for the opposite variable. -------------------------------------------------------------------------------------------------------------------------------------------------- Let's apply this to a real GMAT problem: A man buys some juice boxes. The boxes are from two different brands, A and B. How many boxes of brand A did the man buy if he bought $5.29 worth of boxes? (1) The price of brand A box is $0.81 and the price of brand B box is $0.31 (2) The total amount of boxes is 9
Variables here must be positive integers -number of juice boxes- since it is suggested that some juice boxes are from brand A and the rest from brand B. 1. The equations provided are: (1) 0.81A + 0.31B = 5.29. (2) A + B = 9 Which are reduced to: (1) 81A + 31B = 529 (2) A + B = 9, which is a system of reduced, linear, non-equivalent equations.
2. Find an initial Solution: (1) 81A + 31B = 529. GCF(31, 81)=1. (2) A + B = 9
Mutliplying (2) by 31 and subtracting it from (1) we get: 50A=250 so A=5 and B=4. An initial solution is (5, 4)
3. Unicity: Unicity for statement (1): 81(5) + 31(4) = 529 Since (5 - 31) <=0 AND (4 - 81)<=0 then there no other positive solution than (5, 4) so statement (1) is sufficient.
Unicity for statement (2): It is obvious that statement (2) alone is not sufficient but the test is still applicable. 1(5) + 1(4) = 9 Since (5 - 1) >0 OR (4 - 1) > 0 then there are other positive solutions than (5, 4) so statement (2) is not sufficient. Answer A.
I guess if there is not a quicker way, at least look for which of the numbers will be easier to work with. It is a lot easier to determine if something is divisible by 15 than 29. So start with zero 29 cent stamps and subtract it from 4.40, and see if the result is divisible by 15. If you find more than one solution, stop working and look at the next statement.
Bunuel,im not getting why is B insufficient. we have 15x + 29y = 440 and since x=y, we have 15x + 29x = 440 then x = 10. so y= 10. Can you please explain. Thanx in advance
As noted above by Dreamy you can not use info from statement (1) to solve statement (2), so for (2) we don't know that total $4.40 were spent. _________________
So when we have equation of a type ax+by=c and we know that x and y are non-negative integers, there can be multiple solutions possible for x and y (eg 5x+6y=60) OR just one combination (eg 15x+29y=440). Hence in some cases ax+by=c is NOT sufficient and in some cases it is sufficient.
Is 5x+6y=60 a good example for this case? The only solutions to the above equation(considering only integers are acceptable; you cannot have 1.5 stamps) are x=0;y=10 (or) x=6;y=5. Unless I'm missing another solution. Don't you think 5x+10y=60 would be a better example to show multiple solutions. Just curious.
Additionally if I have an equation ax+by = c; if the coefficients a,b are co-prime, can I be certain that there could possibly be only one combination(other than probably a or b being 0) of a,b that would solve the equation?
No, that's not generally the case. You can find very simple equations with coprime coefficients and multiple integer solutions. If you take, picking an example almost at random,
2x + 3y = 17
this will have integer solutions whenever 17-3y is even, so has positive integer solutions whenever y is odd (and small enough to make the equation work) -- that is, it has positive integer solutions when y = 1, 3 and 5. _________________
GMAT Tutor in Toronto
If you are looking for online GMAT math tutoring, or if you are interested in buying my advanced Quant books and problem sets, please contact me at ianstewartgmat at gmail.com
Ian, Please correct me. In GMAT neither statements contradict. So its good idea to take the hint from 2) statement. Solve for the value of stamps using 1) and 2) x=y and 15x + 29y = 440. Hence x=y=10
Now suspect if 1) ALONE is the "credited" answer. To prove that no other solution exists just put in random integer < 10 and random integer > 10 for x, y in the equation 15x + 29y = 440. In choosing x and y, I know for sure if x > 10 then y < 10 and vice versa. If I get more than one pair of solution, the answer is C otherwise it is A.
IanStewart wrote:
No, that's not generally the case. You can find very simple equations with coprime coefficients and multiple integer solutions. If you take, picking an example almost at random,
2x + 3y = 17
this will have integer solutions whenever 17-3y is even, so has positive integer solutions whenever y is odd (and small enough to make the equation work) -- that is, it has positive integer solutions when y = 1, 3 and 5.
Ian Your explanation almost blows me away Such a profound explanation about factors. I am lovin it ! Please have my kudos !
IanStewart wrote:
gmat1220 wrote:
Ian, Please correct me. In GMAT neither statements contradict. So its good idea to take the hint from 2) statement. Solve for the value of stamps using 1) and 2) x=y and 15x + 29y = 440. Hence x=y=10
Yes, since the Statements never contradict each other, you can be sure from Statement 2 that there must be one solution where x=y, even when you only use Statement 1 alone. The only question then is whether there might be a second solution.
gmat1220 wrote:
Now suspect if 1) ALONE is the "credited" answer. To prove that no other solution exists just put in random integer < 10 and random integer > 10 for x, y in the equation 15x + 29y = 440. In choosing x and y, I know for sure if x > 10 then y < 10 and vice versa. If I get more than one pair of solution, the answer is C otherwise it is A.
No, I would not just haphazardly plug in all conceivable values of y here to see which work; that would take a long time. We have an equation involving positive integers:
15x + 29y = 440
Now, two of the numbers (15 and 440) are multiples of 5. That guarantees that the third number, 29y, is also a multiple of 5, and so y must be a multiple of 5 (if it is not immediately clear that 29y needs to be a multiple of 5 here, you can rewrite the equation as 29y = 440 - 15x = 5(88 - 3x), from which we can see that 29y is equal to a multiple of 5). Doing this you greatly cut down on the number of values you need to test; you now only need to check y= 5, 10 and 15 (since if y = 20, the sum is too large).
Re: Joanna bought only $0.15 stamps and $0.29 stamps. How many [#permalink]
07 Feb 2013, 11:56
1
This post received KUDOS
Hi,
just saw this very useful information in a MGMAT explanation.
In order to prove that no other pair exists, you could figure out what number of stamps are required to do a TRADE between the $0.15 and $0.29 stamps. You would need to trade 29 of the $0.15 stamps against 15 of the $0.29 stamps. Hence you need at least either 30 of the $0.15 stamps or 16 of the $0.29 stamps to be able to do a trade, because according to the statment Joanna buys at least one of each stamp.
To further illustrate this, let's assume Joanna bought $8.80 worth of stamps. Then she could have bought 20 of each of the stamps. (20 * $0.15) + (20 * $0.29) = $8.80 Furthermore you could trade 15 of the $0.29 stamps against 29 of the $0.15 stamps. [(20 + 29) * $0.15] + [(20 - 15) * $0.29] = $8.80
Since the amount of $4.40 limits the number of stamps to 10 each, there is no trade possible and therefore you don't need to do further tests.
Re: Joanna bought only $0.15 stamps and $0.29 stamps. How many [#permalink]
17 Sep 2015, 12:35
1
This post received KUDOS
reto wrote:
Bunuel wrote:
(1) She bought $4.40 worth of stamps --> \(15x+29y=440\). Only one integer combination of \(x\) and \(y\) is possible to satisfy \(15x+29y=440\): \(x=10\) and \(y=10\).
Why is that so clear that only one integer combination fits this? Very difficult to spot...
This is quite representative of a GMAT like question and thus for such questions wherein you are asked number of tickets, number of people, number of toys etc wherein only integer values can work, make sure to try to find a few sets of values for both the variables that will satisfy the given equation which in this case is 15x+29y=440.
Once you create the equation above, you can see that you could also write it as 15x=440-29y which means that 440-29y MUST be a multiple of 15 (as the other side is 15x). Thus once you start by recognizing this fact, you will see that only y=10 satisfies this. For all other values you will not get an integer value of x or get a value <0 (this is not acceptable as number of tickets can not be <0).
Bunuel,im not getting why is B insufficient. we have 15x + 29y = 440 and since x=y, we have 15x + 29x = 440 then x = 10. so y= 10. Can you please explain. Thanx in advance
So when we have equation of a type ax+by=c and we know that x and y are non-negative integers, there can be multiple solutions possible for x and y (eg 5x+6y=60) OR just one combination (eg 15x+29y=440). Hence in some cases ax+by=c is NOT sufficient and in some cases it is sufficient.
Is 5x+6y=60 a good example for this case? The only solutions to the above equation(considering only integers are acceptable; you cannot have 1.5 stamps) are x=0;y=10 (or) x=6;y=5. Unless I'm missing another solution. Don't you think 5x+10y=60 would be a better example to show multiple solutions. Just curious.
First of all the example is not about stamps problem, it's a general example about Diophantine equations and yes, I think it's a good example as it has more than one integer solution. _________________
Additionally if I have an equation ax+by = c; if the coefficients a,b are co-prime, can I be certain that there could possibly be only one combination(other than probably a or b being 0) of a,b that would solve the equation?
The “3 golden nuggets” of MBA admission process With ten years of experience helping prospective students with MBA admissions and career progression, I will be writing this blog through...
You know what’s worse than getting a ding at one of your dreams schools . Yes its getting that horrid wait-listed email . This limbo is frustrating as hell . Somewhere...