At a farm auction, various pieces of farm equipment and livestock are bid on and sold.
Today, there are 7 distinct items up for auction, and there are 3 farmers bidding on them. One of the farmers declares that he will be bid on at least 2 of the items (not specifying which ones), and he won't be outbid.
If this farmer is telling the truth, then how many ways can the items be distributed among farmers?
Assume that all items are sold.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Distinct Objects into Distinct Bins
In this problem, the farming items are modeled as "distinct objects", and the farmers are modeled as "bins."
Let U be the set of all distributions of 7 distinct objects into 3 distinct bins. ∣ U ∣ = 3 7 = 2 1 8 7 .
Let A be the set of all distributions in which the 1st bin receives exactly 0 items, and the 7 items are distributed among the remaining bins. This is equivalent to the set of all distributions of 7 distinct objects into 2 distinct bins. ∣ A ∣ = 2 7 = 1 2 8
Let B be the set of all distributions in which the 1st bin receives exactly 1 item, and the remaining 6 items are distributed among the remaining bins. This is equivalent to the set of all distributions of 6 objects, chosen from 7 distinct objects, into 2 distinct bins. ∣ B ∣ = ( 6 7 ) 2 6 = 4 4 8 .
U ∖ ( A ∪ B ) is the set of all distributions in which the 1st bin receives at least 2 items.
Note that A ∩ B = ∅ , so ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ = 1 2 8 + 4 4 8 = 5 7 6 .
Then ∣ U ∖ ( A ∪ B ) ∣ = 2 1 8 7 − 5 7 6 = 1 6 1 1 .