Let \(S= \{1,2,.....,n\}\) and let \(T\) be the set of all ordered triples of subsets \(S\), say \((A_{1}, A_{2}, A_{3})\), such that \( A_{1} \cup A_{2} \cup A_{3} = S\). Find the cardinality of \(T\) in terms of \(n\). (For example, if \(S = \{1,2,3\}\) and \(A_{1} = \{1, 2\}, A_{2} = \{2, 3\}, A_{3} = \{3\}\) then one of the elements of T is (\(\{1, 2\}, \{2, 3\}, \{3\})\). )
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.