Problems(1)
If X is a finite set, let X denote the number of elements in X. Call an ordered pair (S,T) of subsets of {1,2,⋯,n} \emph {admissible} if s>∣T∣ for each s∈S, and t>∣S∣ for each t∈T. How many admissible ordered pairs of subsets {1,2,⋯,10} are there? Prove your answer. Putnamcollege contests