All public logs
Jump to navigation
Jump to search
Combined display of all available logs of TCS Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
- 07:00, 16 March 2023 Roundgod talk contribs created page 组合数学 (Fall 2023)/Problem Set 1 (Created page with "== Problem 1 == Fix positive integers <math>n</math> and <math>k</math>. Let <math>S</math> be a set with <math>|S|=n</math>. Find the number of <math>k</math>-tuples <math>(T_1,T_2,\dots,T_k)</math> of subsets <math>T_i</math> of <math>S</math> subject to each of the following conditions separately. Briefly explain your solution. * <math>T_1\subseteq T_2\subseteq \cdots \subseteq T_k.</math> * The <math> T_i</math>s are pairwise disjoint. * <math> T_1\cup T_2\cup \cdot...")