There are 120 subsets of size 3 from {1,2,...,10}. Using the pigeonhole principle, prove that if we choose 23 such subsets, there must be two of them whose elements have the same sum
There are 120 subsets of size 3 from {1,2,...,10}. Using the pigeonhole principle, prove that if we choose 23 such subsets, there must be two of them whose elements have the same sum
Algebra and Trigonometry (MindTap Course List)
4th Edition
ISBN:9781305071742
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:James Stewart, Lothar Redlin, Saleem Watson
Chapter14: Counting And Probability
Section14.CR: Chapter Review
Problem 2CC
Related questions
Question
Question: -
There are 120 subsets of size 3 from {1,2,...,10}. Using the pigeonhole principle, prove that if we choose 23 such subsets, there must be two of them whose elements have the same sum
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage