GMAT算术知识点解答
1排列与组合
There are some useful methods for counting objects and sets of objects without actually listing the elements to be counted. The following principle of Multiplication is fundamental to these methods.
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
【GMAT算术知识点解答】相关文章：
GMAT考试全面解答08-14
gmat数学精解之算术的总结01-25
GMAT语法解答技巧梳理11-20
GMAT逻辑题解答技巧08-21
小升初数学算术知识点归纳12-12
逆向思维解答gmat数学考题07-17
小升初数学算术定义定理公式知识点汇总07-08
GMAT数学排列类问题解答01-21
GMAT作文题目的解答技巧11-21