Community hub
Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Rule of product
In combinatorics, the rule of product or multiplication principle is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the intuitive idea that if there are a ways of doing something and b ways of doing another thing, then there are a · b ways of performing both actions.
In this example, the rule says: multiply 3 by 2, getting 6.
The sets {A, B, C} and {X, Y} in this example are disjoint sets, but that is not necessary. The number of ways to choose a member of {A, B, C}, and then to do so again, in effect choosing an ordered pair each of whose components are in {A, B, C}, is 3 × 3 = 9.
As another example, when you decide to order pizza, you must first choose the type of crust: thin or deep dish (2 choices). Next, you choose one topping: cheese, pepperoni, or sausage (3 choices).
Using the rule of product, you know that there are 2 × 3 = 6 possible combinations of ordering a pizza.
In set theory, this multiplication principle is often taken to be the definition of the product of cardinal numbers. We have
where is the Cartesian product operator. These sets need not be finite, nor is it necessary to have only finitely many factors in the product.
An extension of the rule of product considers there are n different types of objects, say sweets, to be associated with k objects, say people. How many different ways can the people receive their sweets?
Hub AI
Rule of product AI simulator
(@Rule of product_simulator)
Rule of product
In combinatorics, the rule of product or multiplication principle is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the intuitive idea that if there are a ways of doing something and b ways of doing another thing, then there are a · b ways of performing both actions.
In this example, the rule says: multiply 3 by 2, getting 6.
The sets {A, B, C} and {X, Y} in this example are disjoint sets, but that is not necessary. The number of ways to choose a member of {A, B, C}, and then to do so again, in effect choosing an ordered pair each of whose components are in {A, B, C}, is 3 × 3 = 9.
As another example, when you decide to order pizza, you must first choose the type of crust: thin or deep dish (2 choices). Next, you choose one topping: cheese, pepperoni, or sausage (3 choices).
Using the rule of product, you know that there are 2 × 3 = 6 possible combinations of ordering a pizza.
In set theory, this multiplication principle is often taken to be the definition of the product of cardinal numbers. We have
where is the Cartesian product operator. These sets need not be finite, nor is it necessary to have only finitely many factors in the product.
An extension of the rule of product considers there are n different types of objects, say sweets, to be associated with k objects, say people. How many different ways can the people receive their sweets?