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.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
Oak trees
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.
C sounds correct for atleast one leave on tree, and D and E are illogical, hence answer is C.
-
davidschneider
- Newbie | Next Rank: 10 Posts
- Posts: 8
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
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
Register for free live sessions
Sentence Correction: Get 4 free video lessons, 50 practice questions
Critical Reasoning workshop: Get 4 free video lessons, 40 practice questions
Reading Comprehension: Get 2 free video lessons and 2 free eBooks
Free Strategy Session: Key strategy to score 760
Success Stories
V27 to V42 | V28 to V48 | V25 to V38 | More Success Stories
Sentence Correction: Get 4 free video lessons, 50 practice questions
Critical Reasoning workshop: Get 4 free video lessons, 40 practice questions
Reading Comprehension: Get 2 free video lessons and 2 free eBooks
Free Strategy Session: Key strategy to score 760
Success Stories
V27 to V42 | V28 to V48 | V25 to V38 | More Success Stories
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.
Good explanation. Such type of questions usually just confound me. :/
Success is the ability to go from failure to failure without losing your enthusiasm.
