Hello everyone!
I'm going over the first manual of MGMAT on Number properties (4th edition).
On page 100 there is an example of a data sufficiency problem that talks about the strategy of testing numbers.
The question lets us know that the possible answer is n=1, n=2, n=3 or n=4. It is a value question. Statement 1 says that n=2k+1 where k is an integer. The text then explains, and I agree, that the expression on statement 1 tells us that n is any odd number and therefore it is inconclusive about the value of n, since it can be either 1 or 3.
However, how can one obtain n=1 from the expression 2k+1??...I assumed that statement 1 would be sufficient because n=3 would be the only odd number to verify the expression n=2k+1 amongst the possible values of n.
Thanks!
I'm going over the first manual of MGMAT on Number properties (4th edition).
On page 100 there is an example of a data sufficiency problem that talks about the strategy of testing numbers.
The question lets us know that the possible answer is n=1, n=2, n=3 or n=4. It is a value question. Statement 1 says that n=2k+1 where k is an integer. The text then explains, and I agree, that the expression on statement 1 tells us that n is any odd number and therefore it is inconclusive about the value of n, since it can be either 1 or 3.
However, how can one obtain n=1 from the expression 2k+1??...I assumed that statement 1 would be sufficient because n=3 would be the only odd number to verify the expression n=2k+1 amongst the possible values of n.
Thanks!
