Oak trees

I choose C although choice D disrupt me a lot of time because of its structure.

Challenging question...Time Sucker
However I reached at correct choice.....C

Finally got to C, which I am glad to see is correct, but I am worried it took me far too long!

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...

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.

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

is it CR or data sufficiency? or quant??

The ANS is C

This question is just hard to comprehend, thanks for explanation,however, i would never have guessed that you can use numbers here.

woh.. this one was a shocker!!

Thanks Dana!

Choice C

A simple question, made look brutal.

:twisted:

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)

excellent explanation

Hey DanaJ, Its a great question! Will appreciate if we get more like this. Thank you

Ans : c

Imagine 2 trees with 1 leave each.