Grinstead-Snell-Probability · Problem 3.1.8

Combinatorics

Mathematics · permutations

Problem

A finite set

\Omega

has

n

elements. Show that if we count the empty set and

\Omega

as subsets, there are

2^n

subsets of

\Omega