Oak trees

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Mon Oct 15, 2012 11:23 am

by deepalimittal26 » Tue Oct 23, 2012 12:56 pm
Answer is A

Newbie | Next Rank: 10 Posts
Posts: 6
Joined: Wed Apr 14, 2010 7:47 pm

by tapdoanhp » Wed Oct 24, 2012 1:25 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.

Senior | Next Rank: 100 Posts
Posts: 87
Joined: Mon May 07, 2012 7:57 am
Thanked: 1 times

by mparakala » Wed Oct 24, 2012 11:42 am
C!

tough one! thanks for posting it!

User avatar
Master | Next Rank: 500 Posts
Posts: 183
Joined: Wed Sep 21, 2011 7:06 am
Location: Washington, DC
Thanked: 6 times
Followed by:2 members
GMAT Score:500

by Rastis » Wed Nov 28, 2012 5:52 am
Does anyone have a better explanation than what has been posted? Also, what does IMO mean?

Newbie | Next Rank: 10 Posts
Posts: 6
Joined: Sun Oct 21, 2012 9:56 am

by brijgmat » Thu Jan 03, 2013 10:47 am
As there is no direct implication for options A and B, I prefer to evaluate C first.

C sounds correct for atleast one leave on tree, and D and E are illogical, hence answer is C.

Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Sat Jan 05, 2013 12:46 am

by dealer88 » Sat Jan 05, 2013 1:13 am
I will go with C and D both...

User avatar
Newbie | Next Rank: 10 Posts
Posts: 8
Joined: Sun Oct 23, 2011 9:23 am

by davidschneider » Sat Jan 05, 2013 1:02 pm
Danaj's explanation was great.

Answer: C

Junior | Next Rank: 30 Posts
Posts: 27
Joined: Thu Aug 18, 2011 3:04 am

by Practicegmat » Tue Jan 08, 2013 8:02 pm
I wish we will not get such questions on the exam day

Master | Next Rank: 500 Posts
Posts: 171
Joined: Tue Jan 08, 2013 7:24 am
Thanked: 1 times

by rajeshsinghgmat » Wed Jan 16, 2013 10:28 pm
C is the answer.

T>L >= 1.

Let, T = 4, then L = {1,2,3}

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 645
Joined: Mon Jul 26, 2010 12:42 pm
Location: US
Thanked: 527 times
Followed by:227 members

by e-GMAT » Sat Jan 19, 2013 3:13 am
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

Newbie | Next Rank: 10 Posts
Posts: 3
Joined: Thu Feb 28, 2013 5:22 am

by ishaparul » Tue Mar 05, 2013 5:15 pm
I only have one thing to say. If I see a question like this on the test, I will be making a guess in less than 5 seconds and moving on to the next question.

Senior | Next Rank: 100 Posts
Posts: 34
Joined: Mon May 13, 2013 7:18 pm

by VyDinh » Mon May 13, 2013 7:52 pm
IMO: A

Newbie | Next Rank: 10 Posts
Posts: 2
Joined: Fri Jul 20, 2012 12:37 am

by akanksha_soneja » Fri Jun 07, 2013 5:24 am
tough question..haven't come across such a a question before...

Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Thu Oct 01, 2009 9:36 pm

by amitkmorti » Fri Jul 05, 2013 7:25 am
Yes... I got it right.

Junior | Next Rank: 30 Posts
Posts: 12
Joined: Fri Nov 01, 2013 11:22 am
Location: India
GMAT Score:590

by sansulee » Thu Nov 07, 2013 2:37 am
Good explanation. Such type of questions usually just confound me. :/
Success is the ability to go from failure to failure without losing your enthusiasm.