Using the pigeonhole principle 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 numbers add up to 16?

College Algebra
1st Edition
ISBN:9781938168383
Author:Jay Abramson
Publisher:Jay Abramson
Chapter9: Sequences, Probability And Counting Theory
Section9.5: Counting Principles
Problem 36SE: The number of 5-element subsets from a set containing n elements is equal to the number of 6-element...
icon
Related questions
Question

Using the pigeonhole principle

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 numbers add up to 16?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning