jessjitsingh
I don't think the answer to this question is correct.
The maximum as 4 makes sense but technically, the minimum value of n can be 0. The question stem says that the the number of shirts is at least two times the number of pants and the way Philip can choose a combination of a shirt and a trouser is 36 which means:
1. M>=2N
2. MC1*NC1 = 36
Now, if I take N as 0 and M as 36, technically, both those conditions are satisfied (yes, 0C1 is equal to 1 -> Philip can choose 0 trousers in 1 way i.e. by not choosing a trouser) so I am not sure why 1 is the minimum value. Can someone/ admin please explain?
I think the constrain of what you are saying is this sentence: "The total ways Philip could select a combination of shirt and trouser is 36."
I believe that every sentence has its meaning in the way of support us to eliminate the options. At first, I wonder why they have to specifically mention the "combination". If I can demonstrate this sentence in terms of math, it should be m*n = 36. When I see the minimum n can be zero, I think "Is n=0 violate the combination of m*n = 36?", or "If n = 0 means Philip cannot choose a trouser, does this action still satisfy the requirement of choose a combination of a shirt and a trouser?"
And to be honest, I think GMAT encourages us to think practically, not math technically. This question is not the only one to prove that idea.