**Foundations of Mathematics
Summer Program , Columbia University
July 2001 -- Handout #1 for Week #3
Roger B. Blumberg**

**Theorem 1**: (*The Fundamental Theorem of Counting*):
Suppose the set
A1 contains n1 members, that the set A2 contains n2 members, the set A3
contains n3 members, ......., and the set A(m) contains n(M) members.
Then the
number of ways to choose one member from each of the m sets is equal to:

© 2001 Roger B. Blumberg