A baked potato can take any number of four available toppings, including none of them. How many different orders are possible?

1. Any number of toppings is allowed, so the question counts every subset of the four toppings. 2. A set of n distinct objects has 2^n subsets. 3. Substituting n = 4 gives 2^4 = 16. 4. So there are 16 possible orders, from the plain potato up to all four toppings. 5. Reporting 4 counts only the single-topping orders and ignores every other choice. _Source: OpenStax Algebra and Trigonometry (CC BY 4.0), Ch 13 "Sequences, Probability and Counting Theory", section 13.5 Counting Principles_