Question 66
A drawer contains 10 black and 10 brown socks which are all mixed up. What is the fewest number of socks you can take from the drawer without looking and be sure to get a pair of the same color?
Solution
For this, we have to consider the worst possible case.
Suppose we get a black piece in the 1st pick and then a brown one in the 2nd pick.
In the 3rd pick, we will either get a black one or a brown one and when it will be placed with the previous two pieces, we will definitely get a pair of socks of the same colour.
Need AI Help?
Create a FREE account and get:
- All Quant Formulas and shortcuts PDF
- 200+ previous papers with solutions PDF
- Top 5000+ MBA exam Solved Questions for Free
SNAP Quant Questions | SNAP Quantitative Ability
SNAP Linear Equations QuestionsSNAP Probability, Combinatorics QuestionsSNAP Functions, Graphs and Statistics QuestionsSNAP Time, Speed and Distance QuestionsSNAP Averages, Ratio and Proportion Questions
SNAP DILR Questions | LRDI Questions For SNAP
SNAP Verbal Ability Questions | VARC Questions For SNAP
Free SNAP Quant Questions
SNAP Data SufficiencySNAP Logarithms, Surds and IndicesSNAP Functions, Graphs and StatisticsSNAP Linear EquationsSNAP Time, Speed and DistanceSNAP Venn DiagramsSNAP InequalitiesSNAP GeometrySNAP Profit and LossSNAP Progressions and SeriesSNAP Number SystemsSNAP Averages, Ratio and ProportionSNAP Quadratic EquationsSNAP Probability, Combinatorics
