5. For sets (not necessarily distinct), the union , then under this condition, the number of possible triples is (write the answer in the form ).
Solution
5. .
As shown in the figure, is divided into seven non-overlapping parts , (where , etc.). Thus, each of the elements has 7 possible allocation places in , so the total number of allocation schemes for these elements is . Any two different allocation schemes will result in different ordered triples (since , are uniquely determined by the ordered triple ), therefore, the number of ordered triples is equal to the total number of allocation schemes for , which is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.