How to read statement

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 4
Joined: Tue Nov 02, 2010 5:58 pm

How to read statement

by blsbball » Tue Nov 30, 2010 11:04 am
Is the positive integer n odd?
  • (1) n = 2k + 1, where k is a positive integer
    (2) 2n + 1 is an odd integer
I sometimes struggle to read the statements correctly when working DS problems. I look at the first statement like this: "Can it be determined if n is odd if n=2k + 1, where k is a positive integer". Plugging in a quick series of numbers show that yes this is sufficient. However statements like number two never seem to sit well with me. If someone could walk me through how they tackle each statement I would appreciate it. Thanks.
answer is A
Source: — Data Sufficiency |

Senior | Next Rank: 100 Posts
Posts: 65
Joined: Tue Nov 23, 2010 9:44 am
Thanked: 16 times
Followed by:6 members
GMAT Score:780

by Laura GMAT Tutor » Tue Nov 30, 2010 11:14 am
You can work it like algebra.

2n + 1 is an odd integer

2n + 1 = odd
2n = odd - 1 An odd - 1 is always even so...
2n = even

Does that mean that n is even? No.
2n is always even if n is an integer. It doesn't matter what n was, whether it was odd or even.

I suggest that you learn odd/even rules so you don't have to pick numbers. :)

In statement 1, the phrase "2k+1" -- that's practically synonymous with "odd"! (assuming k is an integer)
follow me on twitter! :)
@LauraGMATtutor

or visit my blog:
https://realusefulgmat.blocked/

User avatar
Community Manager
Posts: 991
Joined: Thu Sep 23, 2010 6:19 am
Location: Bangalore, India
Thanked: 146 times
Followed by:24 members

by shovan85 » Tue Nov 30, 2010 11:40 am
blsbball wrote:Is the positive integer n odd?
  • (1) n = 2k + 1, where k is a positive integer
    (2) 2n + 1 is an odd integer
Consider each option individually one at a time.

Objective: Is the positive integer n odd?
We need to find using the below given options' info whether we can determine n is odd or not?

Option 1: n = 2k + 1, where k is a positive integer

Put any +ve integer and check the value of n.
k = 1 then n = 3
k = 2 then n = 5
k = 9 then n = 19

Odd always. So sufficient. (If there would have single case where n = 2k+1 is no getting odd then the option would have been insufficient. But this is not the case here)

Option 2: Warning: forget Option 1. You must not bring any info from Option1.

2n + 1 is an odd integer

Try odd some values
2n+1 = 7 then n = 3 (Odd)
2n+1 = 9 then n = 4 (Even)

As we can have both possibilities (Odd/Even) for n this option is Insufficient.

Hence, A is the answer (as only option1 is sufficient)

If you are new to Data Sufficiency I would strongly recommend you to go through this:
https://www.beatthegmat.com/mba/gmat-dat ... ncy-videos
If the problem is Easy Respect it, if the problem is tough Attack it