- A Let S Be A Set Of Positive Integers Where S 10 Prove That There Are Two Distinct Three Element Subsets Of S Whe 1 (8.77 KiB) Viewed 42 times
(a) Let S be a set of positive integers where |S| = 10. Prove that there are two distinct three-element subsets of S whe
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
(a) Let S be a set of positive integers where |S| = 10. Prove that there are two distinct three-element subsets of S whe
(a) Let S be a set of positive integers where |S| = 10. Prove that there are two distinct three-element subsets of S where the sum of the elements of the first and the sum of the elements of the second have the same last two (decimal) digits. (b) Would this result remain true is the set S had cardinality 11 and sums were written in base 11? Justify your answer
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!