1MEASURES of CENTRAL TENDENCY
$MEAN\ $
$\left(\bar{x}\right)\ $
The average of the number
$\bar{x}\ =\ \frac{\sum x}{n}$
2MEASURES of CENTRAL TENDENCY
$MEDIAN\ $
$\left(\widetilde{x}\right) $
The MIDDLE DATA,
when ARRANGE from
LEAST to GREATEST
3MEASURES of CENTRAL TENDENCY
$MODE\ $
$\left(\hat{x}\right)\ $
The VALUE that
APPEARS MOST FREQUENTLY
in a data set
4MEASURES of CENTRAL TENDENCY
$RANGE $
The DIFFERENCE between the
MAXIMUM value
to the
MINIMUM value
${\rm Value}_{max}\ -\ {\rm Value}_{min}$
5MEASURES of DISPERSION
$if\ n>30$
Population Standard Deviation
$\sigma_p=\ \sqrt{\frac{\sum\left(x-\bar{x}\right)^2}{n}}$
6MEASURES of DISPERSION
$if\ n\le\ 30$
Sample Standard Deviation
$\sigma_s=\ \sqrt{\frac{\sum\left(x-\bar{x}\right)^2}{n-1}}$
7MEASURES of POSITION (QUANTILES)
Quartiles
$Q_i=\ \frac{i}{4}\left(n\ +\ 1\right)\ $

8MEASURES of POSITION (QUANTILES)
Decile
revised figure
$D_i=\ \frac{i}{10}\left(n\ +\ 1\right)\ $

9MEASURES of POSITION (QUANTILES)
Percentile
revised figure
$P_i=\ \frac{i}{100}\left(n\ +\ 1\right)$
10DETERMINE FIRST if ARRANGEMENT is
IMPORTANT or NOT IMPORTANT
IMPORTANT = PERMUTATION
NOT IMPORTANT = COMBINATION
11PERMUTATION - arrangement is IMPORTANT
Distinct Permutation
the number of all possible
arrangements or permutations
of n distinct objects taken r at a time.
$n\ P\ r\ =\ \frac{n!}{\left(n\ -r\right)!}$
12PERMUTATION - arrangement is IMPORTANT
Repetitive Permutation
the number of all possible
arrangements or permutations
of n distinct objects taken r at a time with identical objects
$n\ P\ r\ =\ \frac{N!}{R!}$
N= number of obj. (counting certain identical obj as 1)
R= number of how many times the certain obj repeated
13PERMUTATION - arrangement is IMPORTANT
Circular Permutation
total number of ways in which n distinct objects can be arranged
around a fixed circle.
the start and end is indistinctive
$n\ P\ r\ =\ \left(n-1\right)!$
14PERMUTATION - arrangement is IMPORTANT
Circular in Space Permutation
$n\ P\ r\ =\ \frac{\left(n-1\right)!}{2}$
15COMBINATION - arrangement is NOT IMPORTANT
Distinct Combination
$n\ C\ r\ =\ \frac{n!}{r!\ \left(n-r\right)!}$
n= number of choices
r= number of outcomes
16COMBINATION - arrangement is NOT IMPORTANT
Derangement Combination
a derangement of a set leaves no element in its original place
$!n\ =n!\sum_{k=0}^{n}{\ \frac{\left(-1\right)^k}{k!}}$

17relationship between
PERMUTATION and COMBINATION
$n\ C\ r=\ \frac{n\ P\ r}{r\ !}$
18Image occlusion: name the hidden labels
19PROBABILITY
$P\ =\ \frac{SUCCESSFUL\ outcomes}{total\ number\ of\ POSSIBLE\ outcomes}$
20MATHEMATICAL EXPECTATION
If p is the probability that a person
will receive a sum of money S,
the mathematical expectation is defined
$E = pS$
p= probability of success
S= sum of prize
21ODDS in FAVOR
the likelihood of something occurring.
It is a gambling term referring to a mathematical calculation of probability.
$Odds\ in\ Favor\ =\ \frac{SUCCESSFUL\ }{failure}$
22ODDS in AGAINST or FAILURE
the likelihood of something occurring. It is a gambling term referring to a mathematical calculation of probability.
$Odds\ Against\ =\ \frac{failure\ }{SUCCESS}$
23MUTUALLY EXCLUSIVE EVENTS
Two or more events are mutually exclusive ,
they cannot occur simultaneously.
$P\left(A\ \cap B\ \right)=\ 0$
$P\left(A\ \cup B\ \right)=\ P\ \left(A\right)\ +P\ \left(B\right)$
the probability of both events happening at the same time is zero.
For example, when tossing a coin, the result can either be heads or tails, but not both
24MUTUALLY INCLUSIVE EVENTS
Two or more events are mutually inclusive,
if one or the other or both can occur.
$P\left(A\ \cap B\ \right)\neq\ 0$
$P\left(A\ \cup B\ \right)=\ P\ \left(A\right)\ +P\ \left(B\right)-P\left(A\ \cap B\ \right)$
For example, the events “buying an alarm system” and “buying bucket seats”
are mutually inclusive, as both events can happen at the same time
25CONDITIONAL PROBABILITY
Bayes Theorem
$P\left(A|B\right) \cdot P\ \left(B\right)=\ P\left(B|A\right) \cdot P\ \left(A\right)\ =P\left(A\cap B\right)$

26Image occlusion: name the hidden labels
27BINOMIAL DISTRIBUTION
In a binomial experiment
(also called the Bernoulli trial),
there are 2 mutually exclusive outcomes often referred to as “success” and “failure”, or the probability of each trial
is not affected
$ P\ \left(x\ =r\right)=\ \left(n\ C\ r\right)\cdot\left(p^r\right)\cdot{\ \left(q\right)}^{n-r}$
n =number of trials (occurrences)
r =number of successful trials
p =probability of success in a single trial
q = (1-p)
28 BINOMIAL APPROXIMATION
to
NORMAL DISTRIBUTION
usually used in large value
n to be “sufficiently large” it needs to meet
the following criteria
$np\geq\ 5$
$n\left(1-p\right)\geq\ 5$
$\bar{x}\ =\ np$
$\sigma\ =\ \sqrt{npq}$
29POISSON's DISTRIBUTION
The Poisson’s probability that exactly
“r” successes occur in a Poisson experiment
30Image occlusion: name the hidden labels
31NORMAL DISTRIBUTION
LESS than the VALUE
to the left of VALUE
32NORMAL DISTRIBUTION
in BETWEEN the 2 VALUE
towards 0
33NORMAL DISTRIBUTION
GREATER than the VALUE
to the right of VALUE
34Image occlusion: name the hidden labels
35Image occlusion: name the hidden labels
36Image occlusion: name the hidden labels
37Image occlusion: name the hidden labels
38Image occlusion: name the hidden labels
39Image occlusion: name the hidden labels
40Image occlusion: name the hidden labels
41Image occlusion: name the hidden labels
42Image occlusion: name the hidden labels
43Image occlusion: name the hidden labels
44Image occlusion: name the hidden labels
45Image occlusion: name the hidden labels
46Image occlusion: name the hidden labels