how many numbers must be selected from the set {1,3,5,7,9,11,13,15} to guarantee that at least one pair of these number add up to 16 using pegionhole principle
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.