Oak trees
-
- Newbie | Next Rank: 10 Posts
- Posts: 5
- Joined: Mon Oct 15, 2012 11:23 am
IMO, the question is derived from a math problem:
Let say there are K trees in Oregon and have X1, X2,..Xk leave(s)respectively. From the premise, we have:
1<= X1, X2,..Xk <k and X1, X2,... Xk are all positive integers.
AS we know, from 1 to k-1 only have k-1 positive integers then there are at least two Xi, Xj get the same value. Hence, C is the best choice.
Let say there are K trees in Oregon and have X1, X2,..Xk leave(s)respectively. From the premise, we have:
1<= X1, X2,..Xk <k and X1, X2,... Xk are all positive integers.
AS we know, from 1 to k-1 only have k-1 positive integers then there are at least two Xi, Xj get the same value. Hence, C is the best choice.
- davidschneider
- Newbie | Next Rank: 10 Posts
- Posts: 8
- Joined: Sun Oct 23, 2011 9:23 am
-
- Junior | Next Rank: 30 Posts
- Posts: 27
- Joined: Thu Aug 18, 2011 3:04 am
-
- Master | Next Rank: 500 Posts
- Posts: 171
- Joined: Tue Jan 08, 2013 7:24 am
- Thanked: 1 times
GMAT/MBA Expert
- e-GMAT
- GMAT Instructor
- Posts: 645
- Joined: Mon Jul 26, 2010 12:42 pm
- Location: US
- Thanked: 527 times
- Followed by:227 members
This is very mathematical thinking oriented question. I have never come across a similar question among the official CR questions.
However, for the sake of understanding, let's look at it.
Let's suppose there are n tress.
So, any tree can have number of leaves from 1 to n-1. So, n-1 trees can have different values of number of leaves. Now, the reamining tree i.e. the nth tree has to have one of these values (from 1 to n-1) since no values outside this range is possible.
Therefore, at least two trees will have the same number of leaves.
Thus, the correct choice is C.
Hope this helps
Thanks,
Chiranjeev
However, for the sake of understanding, let's look at it.
Let's suppose there are n tress.
So, any tree can have number of leaves from 1 to n-1. So, n-1 trees can have different values of number of leaves. Now, the reamining tree i.e. the nth tree has to have one of these values (from 1 to n-1) since no values outside this range is possible.
Therefore, at least two trees will have the same number of leaves.
Thus, the correct choice is C.
Hope this helps
Thanks,
Chiranjeev
Register for free live sessions
Sentence Correction: Get 4 free video lessons, 50 practice questions
Critical Reasoning workshop: Get 4 free video lessons, 40 practice questions
Reading Comprehension: Get 2 free video lessons and 2 free eBooks
Free Strategy Session: Key strategy to score 760
Success Stories
V27 to V42 | V28 to V48 | V25 to V38 | More Success Stories
Sentence Correction: Get 4 free video lessons, 50 practice questions
Critical Reasoning workshop: Get 4 free video lessons, 40 practice questions
Reading Comprehension: Get 2 free video lessons and 2 free eBooks
Free Strategy Session: Key strategy to score 760
Success Stories
V27 to V42 | V28 to V48 | V25 to V38 | More Success Stories
-
- Newbie | Next Rank: 10 Posts
- Posts: 2
- Joined: Fri Jul 20, 2012 12:37 am
-
- Newbie | Next Rank: 10 Posts
- Posts: 1
- Joined: Thu Oct 01, 2009 9:36 pm