Ask Question
29 November, 13:16

Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9}. n distinct integers will be chosen from A. How big does n have to be

to ensure that the sum of two of the chosen integers is 9?

+5
Answers (1)
  1. 29 November, 15:58
    0
    Partition the set A into 4 subsets: {1, 8}, {2, 7}, {3, 6}, and {4, 5}, each consisting of two integers whose sum is 9. If 5 integers are selected from A, then by the Pigeonhole Principle at least two must be from the same subset. But then the sum of these two integers is 9.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9}. n distinct integers will be chosen from A. How big does n have to be to ensure that the sum of two of ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers