If a first object may be chosen in m ways and a second object may be chosen in n ways, then there are mn ways of choosing both objects.
As an example, suppose the objects are items on a menu. If a meal consists of one entree and one dessert and there are 5 entrees and 3 desserts on the menu, then 53 = 15 different meals can be ordered from the menu. As another example, each time a coin is flipped, there are two possible outcomes, heads and tails. If an experiment consists of 8 consecutive coin flips, the experiment has 28 possible outcomes, where each of these outcomes is a list of heads and tails in some order.
阶乘:factorial notation
假如一个大于1的整数n,计算n的阶乘被表示为n!,被定义为从1至n所有整数的乘积,
例如:4! = 4321= 24
注意:0! = 1! = 1
排列:permutations
The factorial is useful for counting the number of ways that a set of objects can be ordered. If a set of n objects is to be ordered from 1st to nth, there are n choices for the 1st object, n-1 choices for the 2nd object, n-2 choices for the 3rd object, and so on, until there is only 1 choice for the nth object. Thus, by the multiplication principle, the number of ways of ordering the n objects is
n = n!
For example, the number of ways of ordering the letters A, B, and C is 3!, or 6:ABC, ACB, BAC, BCA, CAB, and CBA.
【GMAT数学算数知识精解】相关文章:
最新
2016-03-02
2016-03-02
2016-03-02
2016-03-02
2016-03-02
2016-03-02