Oak trees

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Tue Jul 12, 2011 11:16 pm

by amol.sood » Wed Jul 20, 2011 2:00 am
I also arrived at C but followed a different approach.

Let us start with the assumption that there is only 1 tree and it has 1 leaf.

The question says "There are more oak trees in Oregon than there are leaves on any one Oregon oak tree", which invalidates our first assumption and implies there are atleast two trees.

The question allows trees to have equal number of leaves. If these were the only two trees, with one leaf each, it would still satisfy the condition.

Option C says just that.

User avatar
Legendary Member
Posts: 1255
Joined: Fri Nov 07, 2008 2:08 pm
Location: St. Louis
Thanked: 312 times
Followed by:90 members

by Tani » Wed Jul 20, 2011 6:40 am
Your approach happens to work in this case, but it only shows what COULD be true; it hasn't proven that it MUST be true.
Tani Wolff

Junior | Next Rank: 30 Posts
Posts: 28
Joined: Sat Jan 15, 2011 2:46 pm
Thanked: 2 times

by krishp84 » Sat Jul 30, 2011 5:13 pm
This should be a PS-word question in QUANT....

Legendary Member
Posts: 608
Joined: Sun Jun 19, 2011 11:16 am
Thanked: 37 times
Followed by:8 members

by saketk » Fri Aug 19, 2011 11:01 am
Simply Brutal -- took me 2 mins to understand this. Finally got it correct though :)

IMO -C
Reason -- suppose there are 3 trees. As per the stem, & number of leaves cannot be greater than the number of trees and every tree has atleast 1 leaf. let denote leaf/tree by X.
This gives us condition that X<3
So, lets say - 1st tree has 1 leaf
2nd tree has 2 leaf
3rd tree can only have 1 or 2.

This condition is fulfilled in C.

Junior | Next Rank: 30 Posts
Posts: 16
Joined: Wed Aug 17, 2011 7:34 am
Thanked: 3 times
Followed by:1 members

by AN24 » Fri Aug 19, 2011 11:35 am
Nightmare!

@ Dana: Thanks for the much simplified explanation

User avatar
Legendary Member
Posts: 540
Joined: Sat Dec 20, 2008 7:24 pm
Thanked: 37 times
Followed by:6 members

by navami » Mon Aug 22, 2011 5:19 am
A. the average number of oak leaves per Oregon oak tree must be less than half the number of Oregon oak trees
B. there are fewer leaves on at least one Oregon oak tree than half the number of those trees
C. there must be at least two oak trees in Oregon with the same number of leaves
D. there must be at least as many Oregon oak trees with half as many leaves as the Oregon tree with the most leaves, as there are Oregon oak trees with twice as many leaves as the Oregon oak tree with the fewest leaves
E. there must be more oak trees than any other type of tree in Oregon



C for sure.
Lets assume there is a tree with 5 leaves. then minimum number of trees should be 6.
And any tree should have atleast 1 leaf.
Now you have 6 trees and each of those cah have 1 - 5 number of leaves.
it could be 1 1 1 1 1 5
or 1 2 3 4 5 5
or .......
in any way the option C is valid
This time no looking back!!!
Navami

Junior | Next Rank: 30 Posts
Posts: 12
Joined: Sat Aug 20, 2011 10:06 pm

by sujamait » Sat Aug 27, 2011 12:03 am
My take C,easy one.
take 5 trees with 4,4,4,4,4 leaves ..
problem is finished!

User avatar
Senior | Next Rank: 100 Posts
Posts: 53
Joined: Sun Apr 10, 2011 12:15 pm
Thanked: 1 times

by Deependra1 » Sat Aug 27, 2011 10:13 am
ANSWER: E

Please correct if my answer's incorrect

User avatar
Legendary Member
Posts: 1255
Joined: Fri Nov 07, 2008 2:08 pm
Location: St. Louis
Thanked: 312 times
Followed by:90 members

by Tani » Sat Aug 27, 2011 10:33 am
E is incorrect. WE know nothing about any other type of tree. Review the answers above. There are several clear explanations for why the answer is C.
Tani Wolff

Newbie | Next Rank: 10 Posts
Posts: 6
Joined: Sun Oct 23, 2011 8:03 am

by s1s1s1 » Tue Nov 01, 2011 9:53 am
really challenging!!!

Senior | Next Rank: 100 Posts
Posts: 90
Joined: Thu Nov 05, 2009 9:14 am
Thanked: 5 times
Followed by:3 members

by immaculatesahai » Sun Nov 06, 2011 12:43 am
Wow nice question.. i really wonder how I would respond to such a question in timed gmat conditions... I first marked D. But understand why C is the answer. Great explanation by Dana.

User avatar
Senior | Next Rank: 100 Posts
Posts: 90
Joined: Fri Feb 25, 2011 12:56 am
Thanked: 1 times
Followed by:3 members
GMAT Score:770

by sohrabkalra » Tue Nov 08, 2011 4:10 am
The bet strategy to solve a question like this on D-Day

GUESS AND MOVE ON :)

User avatar
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Tue Nov 22, 2011 9:16 am
Location: Washington DC

by wannabricer » Tue Nov 22, 2011 9:22 am
studying for the LSAT made this question very identifiable and thankfully i was able to come away with C quite quickly. i could eliminate A and E easily because they have nothing to do with the logic being discussed, and the fact that D was worded the way it was made it an easy elimination as well. substituting numbers made the answer plain as day once you realize the finite amount of leaves.

i enjoyed it ;)

...new to the forum. looking into taking the GMAT early next year. i am happy to be on the site and look forward to discussing problems as time goes on!

NICE TO MEET EVERYONE!

User avatar
Legendary Member
Posts: 1255
Joined: Fri Nov 07, 2008 2:08 pm
Location: St. Louis
Thanked: 312 times
Followed by:90 members

by Tani » Tue Nov 22, 2011 11:03 am
You've discovered the secret of the GMAT. Once you begin to "enjoy" the puzzles the test gives you, you are well on your way to conquering it.
Tani Wolff

Junior | Next Rank: 30 Posts
Posts: 21
Joined: Mon Jul 20, 2009 11:57 pm

by ReyWilli » Mon Dec 05, 2011 11:50 am
I am going with C because I used numbers to test. Number of trees 10, number of leaves per tree 9. If each tree had different number of leaves, 9,8,7,6,5,4,3,2,1 you'll have one left over that needs to have same number of leaves as the other 9 in order for leaves per tree to be less than trees.
GMATJunky