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.0563 reviews
Newsweek Readers’ Choice Awards 2026 winner: Target Test Prep, #1 Test Prep
NEWSWEEK READERS’ CHOICE AWARDS 2026

Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.

GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget 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 deepalimittal26 » Tue Oct 23, 2012 12:56 pm
Answer is A
Join the discussion

by tapdoanhp » Wed Oct 24, 2012 1:25 am
IMO, the question is derived from a math problem:
Let say there are K trees in Oregon and have X1, X2,..Xk leave(s)respectively. From the premise, we have:
1<= X1, X2,..Xk <k and X1, X2,... Xk are all positive integers.
AS we know, from 1 to k-1 only have k-1 positive integers then there are at least two Xi, Xj get the same value. Hence, C is the best choice.
Join the discussion

by mparakala » Wed Oct 24, 2012 11:42 am
C!

tough one! thanks for posting it!
Join the discussion

by Rastis » Wed Nov 28, 2012 5:52 am
Does anyone have a better explanation than what has been posted? Also, what does IMO mean?
Join the discussion

by brijgmat » Thu Jan 03, 2013 10:47 am
As there is no direct implication for options A and B, I prefer to evaluate C first.

C sounds correct for atleast one leave on tree, and D and E are illogical, hence answer is C.
Join the discussion

by dealer88 » Sat Jan 05, 2013 1:13 am
I will go with C and D both...
Join the discussion

by davidschneider » Sat Jan 05, 2013 1:02 pm
Danaj's explanation was great.

Answer: C
Join the discussion

by Practicegmat » Tue Jan 08, 2013 8:02 pm
I wish we will not get such questions on the exam day
Join the discussion

by rajeshsinghgmat » Wed Jan 16, 2013 10:28 pm
C is the answer.

T>L >= 1.

Let, T = 4, then L = {1,2,3}
Join the discussion

by e-GMAT » Sat Jan 19, 2013 3:13 am
This is very mathematical thinking oriented question. I have never come across a similar question among the official CR questions.

However, for the sake of understanding, let's look at it.

Let's suppose there are n tress.
So, any tree can have number of leaves from 1 to n-1. So, n-1 trees can have different values of number of leaves. Now, the reamining tree i.e. the nth tree has to have one of these values (from 1 to n-1) since no values outside this range is possible.

Therefore, at least two trees will have the same number of leaves.

Thus, the correct choice is C.

Hope this helps :)

Thanks,
Chiranjeev
Join the discussion

by ishaparul » Tue Mar 05, 2013 5:15 pm
I only have one thing to say. If I see a question like this on the test, I will be making a guess in less than 5 seconds and moving on to the next question.
Join the discussion

by VyDinh » Mon May 13, 2013 7:52 pm
IMO: A
Join the discussion

by akanksha_soneja » Fri Jun 07, 2013 5:24 am
tough question..haven't come across such a a question before...
Join the discussion

by amitkmorti » Fri Jul 05, 2013 7:25 am
Yes... I got it right.
Join the discussion

by sansulee » Thu Nov 07, 2013 2:37 am
Good explanation. Such type of questions usually just confound me. :/
Success is the ability to go from failure to failure without losing your enthusiasm.
Join the discussion