Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

If there are more oak trees in Oregon than there are leaves [#permalink]
16 Apr 2012, 20:41

5

This post received KUDOS

8

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

85% (hard)

Question Stats:

46% (02:40) correct
54% (01:57) wrong based on 244 sessions

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 tree 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.

Let L = the number of leaves on the leafiest tree.

The number of trees must be at least L + 1.

The range of possible numbers of leaves for each tree is from 1 up to L.

If there are L + 1 trees with the number of leaves ranging from 1 to L, there must be at least two trees with the same number of leaves.

E.g. if the tree with the most number of leaves is 2, there must be at least 3 trees with either 1 or 2 leaves - at least two will have the same number of leaves.

The same applies no matter how many leaves (e.g. if the tree with the most leaves has 10,000 leaves, there are at least 10,001 trees with up to 10,000 leaves - at least two must have the same number).

In an inference question , you have to stick very close to the premises.

Here the answer is (C) let's say there is an one oak tree in Oregon which has one leaf . Then there must be at least one more oak tree because the no of oak trees in oregon exceed the number of leaves in one oak tree . This second oak tree must have at least one leaf based on the premises ( it may have more than one leaf but it should have at least one leaf) . This you must have at least two oak trees

Re: If there are more oak trees in Oregon than there are leaves [#permalink]
22 Jun 2012, 07:34

1

This post received KUDOS

Chose C. More math than verbal. Since the average number of leaves per oak tree is less than the number of oak trees, at least two oak trees should have the same number of leaves.

Re: If there are more oak trees in Oregon than there are leaves [#permalink]
22 Jun 2012, 16:51

IMO C. Keywords-"atleast" When a question ask about maximum and minimum, verify the extremes, none of the answer talks about the extremes except D&E,in which D deals with the ambiguous numbers and E with other trees so are irrelevant . I agree with "OldFritz" for his reasoning. _________________

" Make more efforts " Press Kudos if you liked my post

I attended a portfolio workshop hosted by Business Design club today. Competing against thousands of MBA students with the entire world, you need more than your resume and coverletter...

so actually alongside the MBA studies, I am studying for personal trainer exam in December as a side. I can basically only read when I’m in the subway...