author paulson Fri, 12 Jan 2001 18:00:12 +0100 changeset 10888 f321d21b9a6b parent 10887 7fb42b97413a child 10889 aed0a0450797
--- a/doc-src/TutorialI/Sets/sets.tex	Fri Jan 12 17:59:37 2001 +0100
Writing $|A|$ as $n$, the last of these theorems says that the number of
-$k$-element subsets of~$A$ is $n \choose k$.
+$k$-element subsets of~$A$ is $\binom{n}{k}$.
The term \isa{Finite\ A} is an abbreviation for