Oak trees
-
itheenigma
- Master | Next Rank: 500 Posts
- Posts: 103
- Joined: Wed Feb 23, 2011 10:38 am
- Location: India
- Thanked: 7 times
- Followed by:3 members
- GMAT Score:730
My my...what a question.
I had guessed 'C'...But wasn't confident.
Dana's explanation was good, but mk101's analysis really drove the point home!
Nice work guys!
I had guessed 'C'...But wasn't confident.
Dana's explanation was good, but mk101's analysis really drove the point home!
Nice work guys!
-
arora007
- Community Manager
- Posts: 1048
- Joined: Mon Aug 17, 2009 3:26 am
- Location: India
- Thanked: 51 times
- Followed by:27 members
- GMAT Score:670
npunhani wrote:Read: Pigeon hole principle
https://en.wikipedia.org/wiki/Pigeonhole_principle
[spoiler][/spoiler]
A fantastic insight into the " Dirichlet's box principle "
https://www.skiponemeal.org/
https://twitter.com/skiponemeal
Few things are impossible to diligence & skill.Great works are performed not by strength,but by perseverance
pm me if you find junk/spam/abusive language, Lets keep our community clean!!
https://twitter.com/skiponemeal
Few things are impossible to diligence & skill.Great works are performed not by strength,but by perseverance
pm me if you find junk/spam/abusive language, Lets keep our community clean!!
-
Tani
- Legendary Member
- Posts: 1255
- Joined: Fri Nov 07, 2008 2:08 pm
- Location: St. Louis
- Thanked: 312 times
- Followed by:90 members
Assume 5 trees - every tree has less than five leaves and every tree has at least one. There are four options for the number of leaves to choose from 1,2,3,4 and five trees. Four options/five trees - at least two trees must have the same number.
Tani Wolff
-
sayanchakravarty
- Junior | Next Rank: 30 Posts
- Posts: 14
- Joined: Sun May 15, 2011 6:43 pm
-
subhashghosh
- Senior | Next Rank: 100 Posts
- Posts: 43
- Joined: Fri Apr 08, 2011 7:32 am
- Thanked: 2 times
The answer is C.
Take 5 trees, then the number of leaves = 1,2,3,4 (as # of leaves < 5) and the last tree has one of 1,2,3,4 leaves.
Take 5 trees, then the number of leaves = 1,2,3,4 (as # of leaves < 5) and the last tree has one of 1,2,3,4 leaves.
-
[email protected]
- Newbie | Next Rank: 10 Posts
- Posts: 3
- Joined: Sun Jan 02, 2011 9:30 am
There are too many answers on this question as well as other daily question. How do I know which one is the right answer. I assume the right answer for this question is C
DanaJ wrote:Source: Beat The GMAT Practice Questions
If there are more oak trees in Oregon than there are leaves on any one Oregon oak tree, and if every Oregon oak tree has at least one leaf, then __________.
Which of the following most logically completes the passage?
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
-
kishore0912
- Newbie | Next Rank: 10 Posts
- Posts: 4
- Joined: Tue May 31, 2011 7:34 am
-
cans
- Legendary Member
- Posts: 1309
- Joined: Mon Apr 04, 2011 5:34 am
- Location: India
- Thanked: 310 times
- Followed by:123 members
- GMAT Score:750
IMO C
n>m (=max no. of leaves on a tree)
tress have 1,2,3,........m leaves. But as n>m, it means atleast two trees have same no. of leaves.
no. of oak trees = nIf there are more oak trees in Oregon than there are leaves on any one Oregon oak tree, and if every Oregon oak tree has at least one leaf, then __________.
Which of the following most logically completes the passage?
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
n>m (=max no. of leaves on a tree)
tress have 1,2,3,........m leaves. But as n>m, it means atleast two trees have same no. of leaves.
If my post helped you- let me know by pushing the thanks button 
Contact me about long distance tutoring!
[email protected]
Cans!!
Contact me about long distance tutoring!
[email protected]
Cans!!
-
amit2k9
- Master | Next Rank: 500 Posts
- Posts: 461
- Joined: Tue May 10, 2011 9:09 am
- Location: pune
- Thanked: 36 times
- Followed by:3 members
hmm tricky one indeed.
For Understanding Sustainability,Green Businesses and Social Entrepreneurship visit -https://aamthoughts.blocked/
(Featured Best Green Site Worldwide-https://bloggers.com/green/popular/page2)
(Featured Best Green Site Worldwide-https://bloggers.com/green/popular/page2)