x is the sum of y consecutive integers. w is the sum of z consecutive integers. If y = 2z, and y and z are both positive integers, then each of the following could be true EXCEPT
x = w
x > w
x/y is an integer
w/z is an integer
x/z is an integer
How do you solve such problems within 2 minute time limit? This was such a time sucker. I ended up guessing and got wrong. I could have actually got it right if I had time on my hands
Any suggestions?
Time SUCKER- consecutive integers
This topic has expert replies
GMAT/MBA Expert
- Ian Stewart
- GMAT Instructor
- Posts: 2621
- Joined: Mon Jun 02, 2008 3:17 am
- Location: Montreal
- Thanked: 1090 times
- Followed by:355 members
- GMAT Score:780
You'd want to rule out, as quickly as possible, as many answer choices as possible by using extremely simple numbers. So, for example, z could certainly be equal to 1 here, which means w/z and x/z can certainly be integers. That leaves us with A, B and C. And we can continue to use z = 1; it might be that w is the sum of one number, say 3, while x is the sum of two numbers, say 1 and 2, and w can certainly equal z, and A is out. Further, if x is the sum of very large integers, and w is not, then x can easily be larger than w. So B is out. That leaves C.kanha81 wrote:x is the sum of y consecutive integers. w is the sum of z consecutive integers. If y = 2z, and y and z are both positive integers, then each of the following could be true EXCEPT
x = w
x > w
x/y is an integer
w/z is an integer
x/z is an integer
How do you solve such problems within 2 minute time limit? This was such a time sucker. I ended up guessing and got wrong. I could have actually got it right if I had time on my hands
Any suggestions?
Now, you might want to know why C cannot be true. If we take a list of an even number of consecutive integers, where S is the smallest, and L the largest, we have:
S, S+1, S+2, ..., L-2, L-1, L
If we have an even number of terms here, then S+L will certainly be odd. And since we have an even number of terms, we can add them by grouping the largest and smallest, second largest and second smallest, and so on:
x = (S + L) + (S + 1 + L - 1) + (S + 2 + L - 2) + ...
x = (S+L) + (S+L) + (S+L) + ...
x = (y/2)*(S+L)
because we have y/2 pairs of numbers, and each pair adds to S + L. Now, we want to know if x/y could be an integer; that is, we want to know if:
[(y/2)*(S+L)]/y = (S+L)/2
could be an integer. Since S+L is odd, it cannot.
Of course, there are other ways to prove this - using the formula for summing consecutive integers should also work, for example.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
ianstewartgmat.com
-
- Master | Next Rank: 500 Posts
- Posts: 148
- Joined: Wed Jun 03, 2009 8:04 pm
- Thanked: 18 times
- Followed by:1 members
with out any fancy work you can solve it in under 2 min
The question asks what could be not what must be
There is a big difference in could be and in must be ,
For example one can use POE to solve this in under 2 min
The question asks what could be not what must be
There is a big difference in could be and in must be ,
For example one can use POE to solve this in under 2 min
-
- Master | Next Rank: 500 Posts
- Posts: 131
- Joined: Wed May 06, 2009 1:01 pm
- Location: Chicago
- Thanked: 7 times
Sum of N consecutive integers divided by N yields and integer when N is odd while it does not yield an integer if it is even. Since y=2z, y is even and hence C cannot be true.
Vinayak
Vinayak