annsmith66
21.06.2020 •
Mathematics
Let A be a subset of {1, 2, . . . , 25} with |A| = 9. For any subset B of A, denote by SB, the sum of the elements in B. Prove that, no matter which elements A consists of, we can always find distinct subsets C and D of A such that |C| = |D| = 5 and SC = SD. (Hint: How many 5-element subsets of A are there? What is the largest 5-element sum?)
Solved
Show answers
More tips
- F Food and Cooking How to Make Sushi: A Step-by-Step Guide to Perfectly Rolled Delights...
- C Cities and Countries Which Country has the Most Expensive Visa?...
- F Family and Home Tender Care for Your Parquet: Is it Possible to Clean Parquet?...
- S Society and Politics Is It Fact or Fiction? Let s Talk About Anton Chekhov s Pseudonym...
- S Sport Playing Bowling: Rules and Advice for Novices...
- C Computers and Internet How to Properly Repartition a Hard Drive?...
- A Auto and Moto What Is the Cost of Customs Clearance for a Car in Russia?...
- L Leisure and Entertainment Should You Buy a Ceramic Knife?...
- C Computers and Internet How to easily and quickly disable Firebug in Gmail and Google Docs...
- G Goods and services How to sew a ribbon: Tips for beginners...
Answers on questions: Mathematics
- M Mathematics determine whether y varies directly with x. if so, find the constant k and write the equation x =6,18,54,162 y= 24,72,216,648...
- C Chemistry To investigate the effect of salt water on a cell, a researcher places one cell sample in freshwater and a second cell sample in salt water. After six hours, the researcher observes...
- M Mathematics How do you solve for b? equation is t = hp + 2b....
- H History Where would the oldest rock formation be found? A. Location A B. Location B C. Location C D. Location D...
- M Mathematics Kristen bought some necklaces for 14 $23 each she used a coupon for $15 off making her total $41.92 right in equation to find how many necklaces Kristen bought...
Ответ:
Step-by-step explanation:
To solve this problem, we are going to apply the pigeon hole principle, which is as follows:
If m pigeons occupy n pigeon holes and m>n, then there must be at least one pigeonhole that holds more than one pigeon.
To apply this principle, we'll work the problem out to have a pigeon-pigenhole set up.
Consider the set . We want to define the posible values of SB for any B that is a subset of A. The lowest value of Sb would be considering B = . In this case, the sum is 15. The highest value of SB would be when we consider the set B = . In this case SB = 115. So now, consider A as stated and B any subset of A that has 5 elements. Since A has 9 elements and B has 5, we have different sets of 5 elements. Also, we have that
.
Note that given a B, SB is necessarily an integer between 15 and 115, and that given a B, we can assign its sum SB directly by summing up. Consider the different values of SB as pigeonholes and each 5-elements set as pigeons. We have in total 101 possible values (115-15 +1 = 101). Since each set B has a SB, then we are in the case in which we have more pigeons than pigeonholes, so it must happen that there is at least one pigeon hole (value of SB) that has more than one pigeon.
Ответ:
options 1, 2, and 5
Step-by-step explanation:
edgenuity 2020
hope this helps!