# Discrete matematics, using pigeonhole principle [closed]

Assuming that in a box there are $10$ black socks and $12$ blue socks, calculate the maximum number of socks needed to be drawn from the box before a pair of the same color can be made. Using the pigeonhole principle .

The pigeonhole principle: if $k$ is a positive integer and $k+1$ or more object are placed into $k$ boxes , than there is at least one box containing two or more of the object .

## closed as off-topic by user147263, Zev Chonoles, Claude Leibovici, user223391, Tom-TomJul 8 '15 at 7:55

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Zev Chonoles, Claude Leibovici, Community, Tom-Tom
If this question can be reworded to fit the rules in the help center, please edit the question.