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 tuanquang269 » Thu Dec 08, 2011 7:14 am
I choose C although choice D disrupt me a lot of time because of its structure.
Join the discussion

by him1985 » Sun Jan 22, 2012 2:11 am
Challenging question...Time Sucker
However I reached at correct choice.....C
Himanshu Chauhan
Join the discussion

by bostonblue » Mon Jan 30, 2012 7:30 am
Finally got to C, which I am glad to see is correct, but I am worried it took me far too long!
Join the discussion

by nisagl750 » Thu Feb 02, 2012 7:36 am
Its definitely C
let consider just 2 trees. so both of them will have 1 leaf each, for 3 trees all three may have 1 or 2 leaves OR one will have 1 leaf and other two will have 2 leaves and vice versa

Didn't took much time to solve this one... :)
Join the discussion

by amitsakhuja » Sat Feb 11, 2012 5:32 pm
Best to solve by picking numbers ... say # of trees is 100, max number of leaves on a tree is 99. At least two trees have to have the same number of leaves. Answer C.
Join the discussion

by sandstorm » Fri Apr 06, 2012 6:14 am
Instead of looking too much into the language and options, picking of numbers made it easy. Pick two trees and the only options that fit for this no. is C.
Hence, IMO C
Join the discussion

by Gaurav 2013-fall » Fri Apr 06, 2012 11:47 pm
is it CR or data sufficiency? or quant??
Join the discussion

by somsubhra86 » Thu Apr 26, 2012 9:47 am
The ANS is C
Join the discussion

by elenaelena » Wed Jun 06, 2012 2:34 am
This question is just hard to comprehend, thanks for explanation,however, i would never have guessed that you can use numbers here.
Join the discussion

by asax » Tue Jun 19, 2012 12:37 am
woh.. this one was a shocker!!

Thanks Dana! :D
Looking forward to 2013 MBA admissions!
Join the discussion

by UmangMathur » Wed Jul 11, 2012 5:02 am
Choice C

A simple question, made look brutal.

:twisted:
Join the discussion

by vaflaly » Thu Jul 19, 2012 6:57 am
I believe that the answer is C.
we need to rephrase the passage with math word.

number of leave: n

(1) n > number of leaves on any tree
(2) each tree has at least 1 leave

we assume that each trees has different number of leaves.

trees 1st 2nd 3rd 4th 5th 6th .........(n-1)th nth

leave 1 2 3 4 5 6 n-1 (Cannot be n)

the number of leaves for the nth tree cannot be nth because of stmt (1)
Join the discussion

by asdf3719 » Tue Aug 14, 2012 10:55 am
excellent explanation
Join the discussion

by mehulsayani » Tue Aug 14, 2012 11:16 pm
Hey DanaJ, Its a great question! Will appreciate if we get more like this. Thank you :-)
Join the discussion

by sureshcpa » Tue Aug 28, 2012 4:13 am
Ans : c

Imagine 2 trees with 1 leave each.
Join the discussion