1.平均数(average or arithmetic mean)
To calculate the median of n numbers，first order the numbers from least to greatest；if n is odd，the median is defined as the middle number，while if n is even，the median is defined as the average of the two middle numbers. For the data 6, 4, 7, 10, 4, the numbers, in order, are 4, 4, 6, 7, 10, and the median is 6, the middle number. For the numbers 4, 6, 6, 8, 9, 12, the median is (6+8 )/2 = 7. Note that the mean of these numbers is 7.5.
例：the mode of 7，9，6，7，2，1 is 7。
例：the range of–1，7，27，27，36 is 36-(-1)= 37。
One of the most common measures of dispersion is the standard deviation. Generally speaking, the greater the data are spread away from the mean, the greater the standard deviation. The standard deviation of n numbers can be calculated as follows:
(1)find the arithmetic mean ;
(2)find the differences between the mean and each of the n numbers ;
(3)square each of the differences ;
(4)find the average of the squared differences ;
(5)take the nonnegative square root of this average.
Notice that the standard deviation depends on every data value, although it depends most on values that are farthest from the mean. This is why a distribution with data grouped closely around the mean will have a smaller standard deviation than data spread far from the mean.
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 5×3 = 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.
例如：4! = 4×3×2×1= 24
注意：0! = 1! = 1
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-1) (n-2)…( 3) (2) (1) = 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.
These orderings are called the permutations of the letters A, B, and C.也可以用P 33表示.
Pkn = n!/ (n-k)!
例如：1, 2, 3, 4, 5这5个数字构成不同的5位数的总数为5! = 120
A permutation can be thought of as a selection process in which objects are selected one by one in a certain order. If the order of selection is not relevant and only k objects are to be selected from a larger set of n objects, a different counting method is employed.
Specially consider a set of n objects from which a complete selection of k objects is to be made without regard to order, where 0≤k≤n . Then the number of possible complete selections of k objects is called the number of combinations of n objects taken k at a time and is Ckn.
Ckn. = n!/ (n-k)! k!
例如：从5个不同元素中任选2个的组合为C25 = 5!/2! 3!= 10
排列组合的一些特性(properties of permutation and combination)
☆加法原则：Rule of Addition
做某件事有x种方法，每种方法中又有各种不同的解决方法。例如第一种方法中有y1种方法，第二种方法有y2种方法，等等，第x种方法中又有yx种不同的方法，每一种均可完成这件事，即它们之间的关系用“or”表达，那么一般使用加法原则，即有：y1+ y2+。。。+ yx种方法。
☆乘法原则：Rule of Multiplication
Massachusetts Institute of Technology GRE: 1353 GMAT:720 Stanford University (CA) GRE: 1354 GMAT:720 University of California–Berkeley GRE: 1353 GMAT:707 Georgia In
GMAT考试是美国管理专业招收研究生委员会主办和负责指导的考试, 其英文全称是Graduate Management Admission Test。GMAT考试的科目包括会计学、经济学、管理学、普通管理、生产管理、行政管理、