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.

Oak trees

Expert replies

by coolly01 » Sun Feb 27, 2011 8:48 pm
My take is D
:D
Join the discussion

by oldguy » Mon Mar 21, 2011 8:46 am
i eliminated a,d,e and then guessed c instead of b. is c correct?
this is one of those questions to think about for one minute and then answer and move on!
Join the discussion

by itheenigma » Tue May 17, 2011 7:13 am
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!
Join the discussion

by npunhani » Sun May 22, 2011 11:04 am
Read: Pigeon hole principle :)
https://en.wikipedia.org/wiki/Pigeonhole_principle
[spoiler][/spoiler]
Join the discussion

by arora007 » Mon May 23, 2011 7:18 am
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!!
Join the discussion

by Tani » Mon May 23, 2011 7:55 am
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
Join the discussion

by sayanchakravarty » Sun May 29, 2011 7:49 am
Join the discussion

by subhashghosh » Sun May 29, 2011 8:14 am
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.
Join the discussion

by hardikm » Sun May 29, 2011 5:01 pm
IMO C
Join the discussion

by [email protected] » Fri Jun 03, 2011 3:19 pm
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
Join the discussion

by Tani » Sat Jun 04, 2011 4:39 am
The correct answer is C. Assume five oak trees. there are then four possibilities 1,2,3, or 4 leaves. 5 trees, 4 leaves, two must have the same number.
Tani Wolff
Join the discussion

by kishore0912 » Sat Jun 04, 2011 5:41 am
I got this correct. Yippie.
Join the discussion

by cans » Sat Jun 04, 2011 10:21 pm
IMO C
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
no. of oak trees = n
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!!
Join the discussion

by snehadas » Tue Jul 12, 2011 8:11 pm
C.. It was more of a math problem than a verbal one!
Join the discussion

by amit2k9 » Wed Jul 13, 2011 12:02 am
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)
Join the discussion