Chapter 3.2 - Computer Science
... If there are n1 possible outcomes (choices) for a first event, n2 possible outcomes for a second event, … nm possible outcomes for the mth event, then there are n1*n2*…*nm possible outcomes for the sequence of events. Example: Number of locations addressable with 32 bits: ...
... If there are n1 possible outcomes (choices) for a first event, n2 possible outcomes for a second event, … nm possible outcomes for the mth event, then there are n1*n2*…*nm possible outcomes for the sequence of events. Example: Number of locations addressable with 32 bits: ...