BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

head scratching!!

Expert replies
by mehaksal » Wed Aug 15, 2012 6:10 am
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.
Join the discussion
Source: — Critical Reasoning |

by mehaksal » Wed Aug 15, 2012 6:12 am
do such questions actually appear in the actual exam?!!
meanwhile, here is it A or C??
smbdy explained C to be the answr using the method of induction!! blew over my head!!
Join the discussion

by techyrajeev » Wed Aug 15, 2012 6:50 am
C can be the answer. If we take the boundary example:there are four oak trees with 1,2,3 and some leaves tree. last tree must have number of leaves equal to any of the remaining trees otherwise argument conditions will not be met.
Join the discussion

by crisro » Wed Aug 15, 2012 2:52 pm
IMO C is the answer. My reasoning is that if we have a single tree with one leaf and there are more trees than there are leaves on one tree, we must have the second tree with one leaf. If we have only two trees, one with one leaf and the second with two leaves, then we must have the third tree with either one or two leaves; and we can continue with the same reasoning.
Join the discussion

by hjafferi » Wed Aug 22, 2012 6:15 am
Stumped....:(
Join the discussion

by KapTeacherEli » Wed Aug 22, 2012 11:55 am
Though you do not need to have this memorized, it's actually an important mathematical rule called the pigeonhole principle. It is rarely tested, but it can show up. For instance, one Kaplan practice question reads, "If there are 10 white sox, 8 black socks, and 12 blue socks in a drawer, what is the smallest number of socks that can be selected at random that guarantees a pair of the same color is selected?"

[spoiler]Well, here, the "pigeonholes" are the colors. Three socks could be one of each color. But once we have four, we have more socks than colors, and therefore at least once color has to have two socks.[/spoiler]
Eli Meyer
Kaplan GMAT Teacher
Cambridge, MA
www.kaptest.com/gmat

ImageImageImage
Join the discussion

by mohan514 » Fri Aug 24, 2012 9:56 pm
KapTeacherEli wrote:Though you do not need to have this memorized, it's actually an important mathematical rule called the pigeonhole principle. It is rarely tested, but it can show up. For instance, one Kaplan practice question reads, "If there are 10 white sox, 8 black socks, and 12 blue socks in a drawer, what is the smallest number of socks that can be selected at random that guarantees a pair of the same color is selected?"

[spoiler]Well, here, the "pigeonholes" are the colors. Three socks could be one of each color. But once we have four, we have more socks than colors, and therefore at least once color has to have two socks.[/spoiler]
it is still not clear sir

can you pleas elaborate your concept

never heard of this thing..
Join the discussion

by KapTeacherEli » Mon Aug 27, 2012 7:53 pm
Hi mohan,

Check out the link to the wikipedia article in my last post, then let me know if you have questions--though as I said, this is pretty uncommonly tested!

Eli
Eli Meyer
Kaplan GMAT Teacher
Cambridge, MA
www.kaptest.com/gmat

ImageImageImage
Join the discussion

by ankit0411 » Tue Aug 28, 2012 11:21 pm
mehaksal wrote: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.
I came down to C.

Below is what I think might be possible :

1 tree - 5 leaves

# of trees - 6

So total leaves (max) 6*5= 30

Hence, in this case each tree has 5 leaves.

Now if the number of leaves in each tree is different, but remember max # of leaves can by 5 only.

5 4 3 2 1 ( this no can again be either 1,2,3,4 or 5 )

Hence 2 trees will have the same no of leaves.

Hope I understood this right.

Thanks,
Ankit
Don't predict future , create it !
Join the discussion