Fundamental Counting Principle Calculator

The fundamental counting principle, also called the multiplication principle, finds how many outcomes are possible when a process has several successive stages. If one stage can happen in m ways and a second independent stage can happen in n ways, the complete process can happen in m × n ways. The same reasoning extends to any number of stages: multiply all of their choice counts. This calculator accepts two to four stages and uses exact whole-number arithmetic to return the total. Consider choosing an outfit from four shirts and three pairs of pants. Every shirt can be paired with each of the three pants, creating 4 × 3 = 12 outfits. Add two choices of shoes and the count becomes 4 × 3 × 2 = 24. A tree diagram could list every branch, but multiplication reaches the same answer much faster. The principle is especially valuable when listing outcomes would be tedious or impossible. The stages do not need to describe physical choices. A product code with two possible letters in its first position, five digits in its second, and three symbols in its third has 2 × 5 × 3 = 30 possible codes, provided every choice is available after every earlier choice. Menus, travel routes, passwords, experimental designs, computer states, and survey response patterns all use the same rule. The key condition is that each entered count applies for every combination formed before it. If later choices depend on earlier selections, the simple product may need adjustment. For example, selecting two different students for ordered roles is not n × n because the first student cannot be selected again; it is n × (n - 1). Restrictions can often be handled by changing each stage's count to the number actually available at that point, or by splitting the problem into cases and adding their totals. Counting is closely connected to probability. When outcomes are equally likely, a probability is often calculated as favorable outcomes divided by total outcomes, and the multiplication principle supplies one or both counts. It also provides the foundation for permutations, combinations, and factorial formulas. Use this calculator when a task can be represented as a sequence of independent selections. Identify each stage, count its available choices, enter those positive integers, and multiply to obtain the size of the complete outcome space without manually listing it.