##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Direct application
How many binary strings of length exist? Each position has 2 choices (0 or 1), so by the product rule: strings.
For : 000, 001, 010, 011, 100, 101, 110, 111. That is strings. Notice this matches the number of subsets of a 3-element set. Each binary string encodes which elements to include.
