A botanist selects n^2 trees on an island and studies (2n + 1) trees everyday where n is an even integer. He does not study the same tree twice. Which of the following cannot be the number of trees that he studies on the last day of his exercise?
A. 13
B. 28
C. 17
D. 31
E. 79
OA C
Source: Princeton Review
5-Day Free Trial
5-day free, full-access trial TTP
Available with Beat the GMAT members only code
MORE DETAILS
A botanist selects n^2 trees on an island and studies (2n + 1) trees everyday where n is an even integer. He does not
This topic has expert replies
-
BTGmoderatorDC
- Moderator
- Posts: 7187
- Joined: Thu Sep 07, 2017 4:43 pm
- Followed by:23 members
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
-
regor60
- Master | Next Rank: 500 Posts
- Posts: 415
- Joined: Thu Oct 15, 2009 11:52 am
- Thanked: 27 times
Poorly worded question.
As worded, it states that 2K+1 trees are studied every day.
Every day includes the last day, by definition, lol.
This could lead to the natural short cut solution that since 2k+1 is always odd, 28, answer B cannot be the last day.
The question leaves unsaid that the last day can be a remainder, less than 2k+1.
As worded, it states that 2K+1 trees are studied every day.
Every day includes the last day, by definition, lol.
This could lead to the natural short cut solution that since 2k+1 is always odd, 28, answer B cannot be the last day.
The question leaves unsaid that the last day can be a remainder, less than 2k+1.
