Introduction to Probability · Problem 3.1.8

Combinatorics — Grinstead & Snell

Mathematics — Probability · permutations

Problem

A finite set Ω\Omega has nn elements. Show that if we count the empty set and Ω\Omega as subsets, there are 2n2^n subsets of Ω\Omega.

Related theory

Browse the problem library