Gaussian Distribution
Template:Probability distribution\operatorname{exp}\left\{\frac{\left(x\mu\right)^2}{2\sigma^2}\right\}
 cdf = $\backslash frac12\backslash left[1\; +\; \backslash operatorname\{erf\}\backslash left(\; \backslash frac\{x\backslash mu\}\{\backslash sqrt\{2\backslash sigma^2\}\}\backslash right)\backslash right]$  mean = μ  median = μ  mode = μ  variance = $\backslash sigma^2\backslash ,$  skewness = 0  kurtosis = 0  entropy = $\backslash frac12\; \backslash ln(2\; \backslash pi\; e\; \backslash ,\; \backslash sigma^2)$  mgf = $\backslash exp\backslash \{\; \backslash mu\; t\; +\; \backslash frac\{1\}\{2\}\backslash sigma^2t^2\; \backslash \}$  char = $\backslash exp\; \backslash \{\; i\backslash mu\; t\; \; \backslash frac\{1\}\{2\}\backslash sigma^2\; t^2\; \backslash \}$  fisher = $\backslash begin\{pmatrix\}1/\backslash sigma^2\&0\backslash \backslash 0\&1/(2\backslash sigma^4)\backslash end\{pmatrix\}$  conjugate prior = Normal distribution }}
In probability theory, the normal (or Gaussian) distribution is a very commonly occurring continuous probability distribution—a function that tells the probability of a number in some context falling between any two real numbers. For example, the distribution of income measured on a log scale is normally distributed in some contexts, as is often the distribution of grades on a test administered to many people. Normal distributions are extremely important in statistics and are often used in the natural and social sciences for realvalued random variables whose distributions are not known.^{[1]}^{[2]}
The normal distribution is immensely useful because of the central limit theorem, which states that, under mild conditions, the mean of many random variables independently drawn from the same distribution is distributed approximately normally, irrespective of the form of the original distribution: physical quantities that are expected to be the sum of many independent processes (such as measurement errors) often have a distribution very close to the normal. Moreover, many results and methods (such as propagation of uncertainty and least squares parameter fitting) can be derived analytically in explicit form when the relevant variables are normally distributed.
The Gaussian distribution is sometimes informally called the bell curve. However, many other distributions are bellshaped (such as Cauchy's, Student's, and logistic). The terms Gaussian function and Gaussian bell curve are also ambiguous because they sometimes refer to multiples of the normal distribution that cannot be directly interpreted in terms of probabilities.
The normal distribution is
 $$
f(x) = \frac{1}{\sigma\sqrt{2\pi}} e^{ \frac{(x\mu)^2}{2\sigma^2} }. The parameter μ in this formula is the mean or expectation of the distribution (and also its median and mode). The parameter σ is its standard deviation; its variance is therefore σ^{ 2}. A random variable with a Gaussian distribution is said to be normally distributed and is called a normal deviate.
If μ = 0 and σ = 1, the distribution is called the standard normal distribution or the unit normal distribution, and a random variable with that distribution is a standard normal deviate.
The normal distribution is the only absolutely continuous distribution all of whose cumulants beyond the first two (i.e., other than the mean and variance) are zero. It is also the continuous distribution with the maximum entropy for a given mean and variance.^{[3]}^{[4]}
The normal distribution is a subclass of the elliptical distributions. The normal distribution is symmetric about its mean, and is nonzero over the entire real line. As such it may not be a suitable model for variables that are inherently positive or strongly skewed, such as the weight of a person or the price of a share. Such variables may be better described by other distributions, such as the lognormal distribution or the Pareto distribution.
The normal distribution is also practically zero once the value x lies more than a few standard deviations away from the mean. Therefore, it may not be appropriate when one expects a significant fraction of outliers—values that lie many standard deviations away from the mean—and Leastsquares and other statistical inference methods that are optimal for normally distributed variables often become highly unreliable when applied to such data. In those cases, assume a more heavytailed distribution and the appropriate robust statistical inference methods.
Contents
 1 Definition
 2 Properties
 3 Cumulative distribution
 4 Zerovariance limit
 5 The central limit theorem
 6 Operations on normal deviates
 7 Other properties
 8 Related distributions
 9 Normality tests
 10 Estimation of parameters
 11 Bayesian analysis of the normal distribution
 12 Occurrence
 13 Generating values from normal distribution
 14 Numerical approximations for the normal CDF
 15 History
 16 See also
 17 Notes
 18 Citations
 19 References
 20 External links
Definition
Standard normal distribution
The simplest case of a normal distribution is known as the standard normal distribution, described by this probability density function:
 $\backslash phi(x)\; =\; \backslash frac\{1\}\{\backslash sqrt\{2\backslash pi\}\}\backslash ,\; e^\{\; \backslash frac\{\backslash scriptscriptstyle\; 1\}\{\backslash scriptscriptstyle\; 2\}\; x^2\}.$
The factor $\backslash scriptstyle\backslash \; 1/\backslash sqrt\{2\backslash pi\}$ in this expression ensures that the total area under the curve ϕ(x) is equal to one^{[proof]}. The
 REDIRECT Template:Sfrac in the exponent ensures that the distribution has unit variance (and therefore also unit standard deviation). This function is symmetric around x=0, where it attains its maximum value $1/\backslash sqrt\{2\backslash pi\}$; and has inflection points at +1 and −1.
General normal distribution
Any normal distribution is a version of the standard normal distribution whose domain has been stretched by a factor σ (the standard deviation) and then translated by μ (the mean value)
 $$
f(x) = \frac{1}{\sigma} \phi\left(\frac{x\mu}{\sigma}\right).
The probability density must be scaled by $1/\backslash sigma$ so that the integral is still 1.
If Z is a standard normal deviate, then X = Zσ + μ will have a normal distribution with expected value μ and standard deviation σ. Conversely, if X is a general normal deviate, then Z = (X − μ)/σ will have a standard normal distribution.
Every normal distribution is the exponential of a quadratic function:
 $f(x)\; =\; e^\{a\; x^2\; +\; b\; x\; +\; c\}$
where a is negative and c is $\backslash ln(4a\backslash pi)/2$. In this form, the mean value μ is −b/a, and the variance σ^{2} is −1/(2a). For the standard normal distribution, a is −1/2, b is zero, and c is $\backslash ln(2\backslash pi)/2$.
Notation
The standard Gaussian distribution (with zero mean and unit variance) is often denoted with the Greek letter ϕ (phi).^{[5]} The alternative form of the Greek phi letter, φ, is also used quite often.
The normal distribution is also often denoted by N(μ, σ^{2}).^{[6]} Thus when a random variable X is distributed normally with mean μ and variance σ^{2}, we write
 $X\backslash \; \backslash sim\backslash \; \backslash mathcal\{N\}(\backslash mu,\backslash ,\backslash sigma^2).$
Alternative parametrizations
Some authors advocate using the precision τ as the parameter defining the width of the distribution, instead of the deviation σ or the variance σ^{2}. The precision is normally defined as the reciprocal of the variance, 1/σ^{2}.^{[7]} The formula for the distribution then becomes
 $f(x)\; =\; \backslash sqrt\{\backslash frac\{\backslash tau\}\{2\backslash pi\}\}\backslash ,\; e^\{\backslash frac\{\backslash tau(x\backslash mu)^2\}\{2\}\}.$
This choice is claimed to have advantages in numerical computations when σ is very close to zero and simplify formulas in some contexts, such as in the Bayesian inference of variables with multivariate normal distribution.
Occasionally, the precision τ is 1/σ, the reciprocal of the standard deviation; so that
 $f(x)\; =\; \backslash frac\{\backslash tau\}\{\backslash sqrt\{2\backslash pi\}\}\backslash ,\; e^\{\backslash frac\{\backslash tau^2(x\backslash mu)^2\}\{2\}\}.$
Alternative definitions
Authors may differ also on which normal distribution should be called the "standard" one. Gauss himself defined the standard normal as having variance σ^{2} =
 REDIRECT Template:Sfrac, that is
 $f(x)\; =\; \backslash frac\{1\}\{\backslash sqrt\backslash pi\}\backslash ,e^\{x^2\}$
Stephen Stigler^{[8]} goes even further, defining the standard normal with variance σ^{2} =
 REDIRECT Template:Sfrac :
 $f(x)\; =\; e^\{\backslash pi\; x^2\}$
According to Stigler, this formulation is advantageous because of a much simpler and easiertoremember formula, the fact that the pdf has unit height at zero, and simple approximate formulas for the quantiles of the distribution.
Properties
Symmetries and derivatives
The normal distribution f(x), with any mean μ and any positive deviation σ, has the following properties:
 It is symmetric around the point x = μ, which is at the same time the mode, the median and the mean of the distribution.^{[9]}
 It is unimodal: its first derivative is positive for x < μ, negative for x > μ, and zero only at x = μ.
 It has two inflection points (where the second derivative of f is zero and changes sign), located one standard deviation away from the mean, namely at x = μ − σ and x = μ + σ.^{[9]}
 It is logconcave.^{[9]}
 It is infinitely differentiable, indeed supersmooth of order 2.^{[10]}
Furthermore, the standard normal distribution ϕ (with μ = 0 and σ = 1) also has the following properties:
 Its first derivative ϕ′(x) is −xϕ(x).
 Its second derivative ϕ′′(x) is (x^{2} − 1)ϕ(x)
 More generally, its nth derivative ϕ^{(n)}(x) is (1)^{n}H_{n}(x)ϕ(x), where H_{n} is the Hermite polynomial of order n.^{[11]}
Moments
The plain and absolute moments of a variable X are the expected values of X^{p} and X^{p},respectively. If the expected value μ of X is zero, these parameters are called central moments. Usually we are interested only in moments with integer order p.
If X has a normal distribution, these moments exist and are finite for any p whose real part is greater than −1. For any nonnegative integer p, the plain central moments are
 $$
\mathrm{E}\left[X^p\right] = \begin{cases} 0 & \text{if }p\text{ is odd,} \\ \sigma^p\,(p1)!! & \text{if }p\text{ is even.} \end{cases}
Here n!! denotes the double factorial, that is the product of every odd number from n to 1.
The central absolute moments coincide with plain moments for all even orders, but are nonzero for odd orders. For any nonnegative integer p,
 $$
\operatorname{E}\left[X^p\right] = \sigma^p\,(p1)!! \cdot \left.\begin{cases} \sqrt{\frac{2}{\pi}} & \text{if }p\text{ is odd} \\ 1 & \text{if }p\text{ is even} \end{cases}\right\} = \sigma^p \cdot \frac{2^{\frac{p}{2}}\Gamma\left(\frac{p+1}{2}\right)}{\sqrt{\pi}}
The last formula is valid also for any noninteger p > −1.
When the mean μ is not zero, the plain and absolute moments can be expressed in terms of confluent hypergeometric functions _{1}F_{1} and U.
 $\backslash begin\{align\}$
\operatorname{E} \left[ X^p \right] &=\sigma^p \cdot (i\sqrt{2}\sgn\mu)^p \; U\left( {\frac{1}{2}p},\, \frac{1}{2},\, \frac{1}{2}(\mu/\sigma)^2 \right), \\
\operatorname{E} \left[ X^p \right] &=\sigma^p \cdot 2^{\frac p 2} \frac {\Gamma\left(\frac{1+p}{2}\right)}{\sqrt\pi}\; _1F_1\left( {\frac{1}{2}p},\, \frac{1}{2},\, \frac{1}{2}(\mu/\sigma)^2 \right). \end{align}
These expressions remain valid even if p is not integer. See also generalized Hermite polynomials.
Order  Noncentral moment  Central moment 

1  μ  0 
2  μ^{2} + σ^{2}  σ^{ 2} 
3  μ^{3} + 3μσ^{2}  0 
4  μ^{4} + 6μ^{2}σ^{2} + 3σ^{4}  3σ^{ 4} 
5  μ^{5} + 10μ^{3}σ^{2} + 15μσ^{4}  0 
6  μ^{6} + 15μ^{4}σ^{2} + 45μ^{2}σ^{4} + 15σ^{6}  15σ^{ 6} 
7  μ^{7} + 21μ^{5}σ^{2} + 105μ^{3}σ^{4} + 105μσ^{6}  0 
8  μ^{8} + 28μ^{6}σ^{2} + 210μ^{4}σ^{4} + 420μ^{2}σ^{6} + 105σ^{8}  105σ^{ 8} 
Fourier transform and characteristic function
The Fourier transform of a normal distribution f with mean μ and deviation σ is^{[12]}
 $$
\hat\phi(t) = \int_{\infty}^\infty\! f(x)e^{itx} dx = e^{\mathbf{i}\mu t} e^{ \frac12 (\sigma t)^2}
where i is the imaginary unit. If the mean μ is zero, the first factor is 1, and the Fourier transform is also a normal distribution on the frequency domain, with mean 0 and standard deviation 1/σ. In particular, the standard normal distribution ϕ (with μ=0 and σ=1) is an eigenfunction of the Fourier transform.
In probability theory, the Fourier transform of the probability distribution of a realvalued random variable X is called the characteristic function of that variable, and can be defined as the expected value of e^{itX}, as a function of the real variable t (the frequency parameter of the Fourier transform). This definition can be analytically extended to a complexvalue parameter t.^{[13]}
Moment and cumulant generating functions
The moment generating function of a real random variable X is the expected value of e^{tX}, as a function of the real parameter t. For a normal distribution with mean μ and deviation σ, the moment generating function exists and is equal to
 $M(t)\; =\; \backslash hat\; \backslash phi(\backslash mathbf\{i\}t)\; =\; e^\{\; \backslash mu\; t\}\; e^\{\backslash frac12\; \backslash sigma^2\; t^2\; \}$
The cumulant generating function is the logarithm of the moment generating function, namely
 $g(t)\; =\; \backslash ln\; M(t)\; =\; \backslash mu\; t\; +\; \backslash frac\{1\}\{2\}\; \backslash sigma^2\; t^2$
Since this is a quadratic polynomial in t, only the first two cumulants are nonzero, namely the mean μ and the variance σ^{2}.
Cumulative distribution
The cumulative distribution function (CDF) of the standard normal distribution, usually denoted with the capital Greek letter $\backslash Phi$ (phi), is the integral
 $\backslash Phi(x)\backslash ;\; =\; \backslash ;\backslash frac\{1\}\{\backslash sqrt\{2\backslash pi\}\}\; \backslash int\_\{\backslash infty\}^x\; e^\{t^2/2\}\; \backslash ,\; dt$
Therefore here are some trivial results from area under bell curve 
 $\backslash Phi(\{\backslash infty\})\; =\; 0\; =\; 0\%$
 $\backslash Phi(0)\; =\; 0.5\; =\; 50\%$
 $\backslash Phi(\{\backslash infty\})\; =\; 1=\; 100\%$
 $\backslash Phi(x)\; =\; 1\; \backslash Phi(x)$ and therefore $\backslash Phi(x)\; +\; \backslash Phi(x)\; =\; 100\%$
In statistics one often uses the related error function, or erf(x), defined as the probability of a random variable with normal distribution of mean 0 and variance 1/2 falling in the range $[x,\; x]$; that is
 $\backslash operatorname\{erf\}(x)\backslash ;\; =\backslash ;\; \backslash frac\{1\}\{\backslash sqrt\{\backslash pi\}\}\; \backslash int\_\{x\}^x\; e^\{t^2\}\; \backslash ,\; dt$
These integrals cannot be expressed in terms of elementary functions, and are often said to be special functions. They are closely related, namely
 $\backslash Phi(x)\backslash ;\; =\backslash ;\; \backslash frac12\backslash left[1\; +\; \backslash operatorname\{erf\}\backslash left(\backslash frac\{x\}\{\backslash sqrt\{2\}\}\backslash right)\backslash right]$
For a generic normal distribution f with mean μ and deviation σ, the cumulative distribution function is
 $F(x)\backslash ;=\backslash ;\backslash Phi\backslash left(\backslash frac\{x\backslash mu\}\{\backslash sigma\}\backslash right)\backslash ;=\backslash ;\; \backslash frac12\backslash left[1\; +\; \backslash operatorname\{erf\}\backslash left(\backslash frac\{x\backslash mu\}\{\backslash sigma\backslash sqrt\{2\}\}\backslash right)\backslash right]$
The complement of the standard normal CDF, $Q(x)\; =\; 1\; \; \backslash Phi(x)$, is often called the Qfunction, especially in engineering texts.^{[14]}^{[15]} It gives the probability that the value of a standard normal random variable X will exceed x. Other definitions of the Qfunction, all of which are simple transformations of $\backslash Phi$, are also used occasionally.^{[16]}
The graph of the standard normal CDF $\backslash Phi$ has 2fold rotational symmetry around the point (0,1/2); that is, $\backslash Phi(x)\; =\; 1\; \; \backslash Phi(x)$. Its antiderivative (indefinite integral) $\backslash int\; \backslash Phi(x)\backslash ,\; dx$ is $\backslash int\; \backslash Phi(x)\backslash ,\; dx\; =\; x\backslash Phi(x)\; +\; \backslash phi(x)$.
Standard deviation and tolerance intervals
About 68% of values drawn from a normal distribution are within one standard deviation σ away from the mean; about 95% of the values lie within two standard deviations; and about 99.7% are within three standard deviations. This fact is known as the 689599.7 (empirical) rule, or the 3sigma rule.
More precisely, the probability that a normal deviate lies in the range μ − nσ and μ + nσ is given by
 $$
F(\mu+n\sigma)  F(\mun\sigma) = \Phi(n)\Phi(n) = \mathrm{erf}\left(\frac{n}{\sqrt{2}}\right),
To 12 decimal places, the values for n = 1, 2, ..., 6 are:^{[17]}
n  F(μ+nσ) − F(μ−nσ)  i.e. 1 minus ...  or 1 in ...  OEIS 

1  0.682689492137  0.317310507841  3.15148718751  A178647 
2  0.954499736982  0.045500263830  21.9778945088  A110894 
3  0.997300203755  0.002699796063  370.398347345  
4  0.999936657332  0.000063342484  15787.1927673  
5  0.999999426411  0.000000573303  1744277.89362  
6  0.999999998841  0.000000001973  506797345.897 
Quantile function
The quantile function of a distribution is the inverse of the cumulative distribution function. The quantile function of the standard normal distribution is called the probit function, and can be expressed in terms of the inverse error function:
 $$
\Phi^{1}(p)\; =\; \sqrt2\;\operatorname{erf}^{1}(2p  1), \quad p\in(0,1).
For a normal random variable with mean μ and variance σ^{2}, the quantile function is
 $$
F^{1}(p) = \mu + \sigma\Phi^{1}(p) = \mu + \sigma\sqrt2\,\operatorname{erf}^{1}(2p  1), \quad p\in(0,1).
The quantile $\backslash Phi^\{1\}(p)$ of the standard normal distribution is commonly denoted as z_{p}. These values are used in hypothesis testing, construction of confidence intervals and QQ plots. A normal random variable X will exceed μ + σz_{p} with probability 1−p; and will lie outside the interval μ ± σz_{p} with probability 2(1−p). In particular, the quantile z_{0.975} is 1.96; therefore a normal random variable will lie outside the interval μ ± 1.96σ in only 5% of cases.
The following table gives the multiple n of σ such that X will lie in the range μ ± nσ with a specified probability p. These values are useful to determine tolerance interval for sample averages and other statistical estimators with normal (or asymptotically normal) distributions:^{[18]}
F(μ+nσ) − F(μ−nσ)  n  F(μ+nσ) − F(μ−nσ)  n  

0.80  1.281551565181  0.999  3.290526731236  
0.90  1.644853626351  0.9999  3.890591886251  
0.95  1.959963984324  0.99999  4.417173413247  
0.98  2.326347874645  0.999999  4.891638475479  
0.99  2.575829303965  0.9999999  5.326723886308  
0.995  2.807033768904  0.99999999  5.730728868016  
0.998  3.090232306142  0.999999999  6.109410204829 
Zerovariance limit
In the limit when σ tends to zero, the probability density f(x) eventually tends to zero at any x ≠ μ, but grows without limit if x = μ, while its integral remains equal to 1. Therefore, the normal distribution cannot be defined as an ordinary function when σ = 0.
However, one can define the normal distribution with zero variance as a generalized function; specifically, as Dirac's "delta function" δ translated by the mean μ, that is f(x) = δ(x−μ). Its CDF is then the Heaviside step function translated by the mean μ, namely
 $$
F(x) = \begin{cases} 0 & \text{if }x < \mu \\ 1 & \text{if }x \geq \mu \end{cases}
The central limit theorem
The central limit theorem states that under certain (fairly common) conditions, the sum of many random variables will have an approximately normal distribution. More specifically, where X_{1}, …, X_{n} are independent and identically distributed random variables with the same arbitrary distribution, zero mean, and variance σ^{2}; and Z is their mean scaled by $\backslash sqrt\{n\}$
 $Z\; =\; \backslash sqrt\{n\}\backslash left(\backslash frac\{1\}\{n\}\backslash sum\_\{i=1\}^n\; X\_i\backslash right)$
Then, as n increases, the probability distribution of Z will tend to the normal distribution with zero mean and variance σ^{2}.
The theorem can be extended to variables X_{i} that are not independent and/or not identically distributed if certain constraints are placed on the degree of dependence and the moments of the distributions.
Many test statistics, scores, and estimators encountered in practice contain sums of certain random variables in them, and even more estimators can be represented as sums of random variables through the use of influence functions. The central limit theorem implies that those statistical parameters will have asymptotically normal distributions.
The central limit theorem also implies that certain distributions can be approximated by the normal distribution, for example:
 The binomial distribution B(n, p) is approximately normal with mean np and variance np(1−p)) for large n and for p not too close to zero or one.
 The Poisson distribution with parameter λ is approximately normal with mean λ and variance λ, for large values of λ.^{[19]}
 The chisquared distribution χ^{2}(k) is approximately normal with mean k and variance 2k, for large k.
 The Student's tdistribution t(ν) is approximately normal with mean 0 and variance 1 when ν is large.
Whether these approximations are sufficiently accurate depends on the purpose for which they are needed, and the rate of convergence to the normal distribution. It is typically the case that such approximations are less accurate in the tails of the distribution.
A general upper bound for the approximation error in the central limit theorem is given by the Berry–Esseen theorem, improvements of the approximation are given by the Edgeworth expansions.
Operations on normal deviates
The family of normal distributions is closed under linear transformations: if X is normally distributed with mean μ and deviation σ, then the variable Y = aX + b, for any real numbers a and b, is also normally distributed, with mean aμ + b and deviation aσ.
Also if X_{1} and X_{2} are two independent normal random variables, with means μ_{1}, μ_{2} and standard deviations σ_{1}, σ_{2}, then their sum X_{1} + X_{2} will also be normally distributed,^{[proof]} with mean μ_{1} + μ_{2} and variance $\backslash sigma\_1^2\; +\; \backslash sigma\_2^2$.
In particular, if X and Y are independent normal deviates with zero mean and variance σ^{2}, then X + Y and X − Y are also independent and normally distributed, with zero mean and variance 2σ^{2}. This is a special case of the polarization identity.^{[20]}
Also, if X_{1}, X_{2} are two independent normal deviates with mean μ and deviation σ, and a, b are arbitrary real numbers, then the variable
 $$
X_3 = \frac{aX_1 + bX_2  (a+b)\mu}{\sqrt{a^2+b^2}} + \mu
is also normally distributed with mean μ and deviation σ. It follows that the normal distribution is stable (with exponent α = 2).
More generally, any linear combination of independent normal deviates is a normal deviate.
Infinite divisibility and Cramér's theorem
For any positive integer n, any normal distribution with mean μ and variance σ^{2} is the distribution of the sum of n independent normal deviates, each with mean μ/n and variance σ^{2}/n. This property is called infinite divisibility.^{[21]}
Conversely, if X_{1} and X_{2} are independent random variables and their sum X_{1} + X_{2} has a normal distribution, then both X_{1} and X_{2} must be normal deviates.^{[22]}
This result is known as Cramér's decomposition theorem, and is equivalent to saying that the convolution of two distributions is normal if and only if both are normal. Cramér's theorem implies that a linear combination of independent nonGaussian variables will never have an exactly normal distribution, although it may approach it arbitrarily close.^{[23]}
Bernstein's theorem
Bernstein's theorem states that if X and Y are independent and X + Y and X − Y are also independent, then both X and Y must necessarily have normal distributions.^{[24]}^{[25]}
More generally, if X_{1}, ..., X_{n} are independent random variables, then two distinct linear combinations ∑a_{k}X_{k} and ∑b_{k}X_{k} will be independent if and only if all X_{k}'s are normal and ∑a_{k}b_{k}σ 2
k = 0, where σ 2
k denotes the variance of X_{k}.^{[24]}
Other properties
 If the characteristic function φ_{X} of some random variable X is of the form φ_{X}(t) = e^{Q(t)}, where Q(t) is a polynomial, then the Marcinkiewicz theorem (named after Józef Marcinkiewicz) asserts that Q can be at most a quadratic polynomial, and therefore X a normal random variable.^{[23]} The consequence of this result is that the normal distribution is the only distribution with a finite number (two) of nonzero cumulants.
 If X and Y are jointly normal and uncorrelated, then they are independent. The requirement that X and Y should be jointly normal is essential, without it the property does not hold.^{[26]}^{[27]}^{[proof]} For nonnormal random variables uncorrelatedness does not imply independence.
 The Kullback–Leibler divergence of one normal distributions X_{1} ∼ N(μ_{1}, σ^{2}_{1} )from another X_{2} ∼ N(μ_{2}, σ^{2}_{2} )is given by:^{[28]}
 $$
 $$
 The Fisher information matrix for a normal distribution is diagonal and takes the form
 $$
 Normal distributions belongs to an exponential family with natural parameters $\backslash scriptstyle\backslash theta\_1=\backslash frac\{\backslash mu\}\{\backslash sigma^2\}$ and $\backslash scriptstyle\backslash theta\_2=\backslash frac\{1\}\{2\backslash sigma^2\}$, and natural statistics x and x^{2}. The dual, expectation parameters for normal distribution are η_{1} = μ and η_{2} = μ^{2} + σ^{2}.
 The conjugate prior of the mean of a normal distribution is another normal distribution.^{[29]} Specifically, if x_{1}, …, x_{n} are iid N(μ, σ^{2}) and the prior is μ ~ N(μ_{0}, σ2
0), then the posterior distribution for the estimator of μ will be $$
 Of all probability distributions over the reals with mean μ and variance σ^{2}, the normal distribution N(μ, σ^{2}) is the one with the maximum entropy.^{[30]}
 The family of normal distributions forms a manifold with constant curvature −1. The same family is flat with respect to the (±1)connections ∇^{(e)} and ∇^{(m)}.^{[31]}
Related distributions
Operations on a single random variable
If X is distributed normally with mean μ and variance σ^{2}, then
 The exponential of X is distributed lognormally: e^{X} ~ ln(N (μ, σ^{2})).
 The absolute value of X has folded normal distribution: X ~ N_{f} (μ, σ^{2}). If μ = 0 this is known as the halfnormal distribution.
 The square of X/σ has the noncentral chisquared distribution with one degree of freedom: X^{2}/σ^{2} ~ χ^{2}_{1}(μ^{2}/σ^{2}). If μ = 0, the distribution is called simply chisquared.
 The distribution of the variable X restricted to an interval [a, b] is called the truncated normal distribution.
 (X − μ)^{−2} has a Lévy distribution with location 0 and scale σ^{−2}.
Combination of two independent random variables
If X_{1} and X_{2} are two independent standard normal random variables with mean 0 and variance 1, then
 Their sum and difference is distributed normally with mean zero and variance two: X_{1} ± X_{2} ∼ N(0, 2).
 Their product Z = X_{1}·X_{2} follows the "productnormal" distribution^{[32]} with density function f_{Z}(z) = π^{−1}K_{0}(z), where K_{0} is the modified Bessel function of the second kind. This distribution is symmetric around zero, unbounded at z = 0, and has the characteristic function φ_{Z}(t) = (1 + t^{ 2})^{−1/2}.
 Their ratio follows the standard Cauchy distribution: X_{1} ÷ X_{2} ∼ Cauchy(0, 1).
 Their Euclidean norm $\backslash scriptstyle\backslash sqrt\{X\_1^2\backslash ,+\backslash ,X\_2^2\}$ has the Rayleigh distribution, also known as the chi distribution with 2 degrees of freedom.
Combination of two or more independent random variables
 If X_{1}, X_{2}, …, X_{n} are independent standard normal random variables, then the sum of their squares has the chisquared distribution with n degrees of freedom
 $X\_1^2\; +\; \backslash cdots\; +\; X\_n^2\backslash \; \backslash sim\backslash \; \backslash chi\_n^2.$.
 If X_{1}, X_{2}, …, X_{n} are independent normally distributed random variables with means μ and variances σ^{2}, then their sample mean is independent from the sample standard deviation,^{[33]} which can be demonstrated using Basu's theorem or Cochran's theorem.^{[34]} The ratio of these two quantities will have the Student's tdistribution with n − 1 degrees of freedom:
 $t\; =\; \backslash frac\{\backslash overline\; X\; \; \backslash mu\}\{S/\backslash sqrt\{n\}\}\; =\; \backslash frac\{\backslash frac\{1\}\{n\}(X\_1+\backslash cdots+X\_n)\; \; \backslash mu\}\{\backslash sqrt\{\backslash frac\{1\}\{n(n1)\}\backslash left[(X\_1\backslash overline\; X)^2+\backslash cdots+(X\_n\backslash overline\; X)^2\backslash right]\}\}\; \backslash \; \backslash sim\backslash \; t\_\{n1\}.$
 If X_{1}, …, X_{n}, Y_{1}, …, Y_{m} are independent standard normal random variables, then the ratio of their normalized sums of squares will have the Fdistribution with (n, m) degrees of freedom:^{[35]}
 $F\; =\; \backslash frac\{\backslash left(X\_1^2+X\_2^2+\backslash cdots+X\_n^2\backslash right)/n\}\{\backslash left(Y\_1^2+Y\_2^2+\backslash cdots+Y\_m^2\backslash right)/m\}\backslash \; \backslash sim\backslash \; F\_\{n,\backslash ,m\}.$
Operations on the density function
The split normal distribution is most directly defined in terms of joining scaled sections of the density functions of different normal distributions and rescaling the density to integrate to one. The truncated normal distribution results from rescaling a section of a single density function.
Extensions
The notion of normal distribution, being one of the most important distributions in probability theory, has been extended far beyond the standard framework of the univariate (that is onedimensional) case (Case 1). All these extensions are also called normal or Gaussian laws, so a certain ambiguity in names exists.
 The multivariate normal distribution describes the Gaussian law in the kdimensional Euclidean space. A vector X ∈ R^{k} is multivariatenormally distributed if any linear combination of its components ∑k
j=1a_{j} X_{j} has a (univariate) normal distribution. The variance of X is a k×k symmetric positivedefinite matrix V. The multivariate normal distribution is a special case of the elliptical distributions. As such, its isodensity loci in the k = 2 case are ellipses and in the case of arbitrary k are ellipsoids.  Rectified Gaussian distribution a rectified version of normal distribution with all the negative elements reset to 0
 Complex normal distribution deals with the complex normal vectors. A complex vector X ∈ C^{k} is said to be normal if both its real and imaginary components jointly possess a 2kdimensional multivariate normal distribution. The variancecovariance structure of X is described by two matrices: the variance matrix Γ, and the relation matrix C.
 Matrix normal distribution describes the case of normally distributed matrices.
 Gaussian processes are the normally distributed stochastic processes. These can be viewed as elements of some infinitedimensional Hilbert space H, and thus are the analogues of multivariate normal vectors for the case k = ∞. A random element h ∈ H is said to be normal if for any constant a ∈ H the scalar product (a, h) has a (univariate) normal distribution. The variance structure of such Gaussian random element can be described in terms of the linear covariance operator K: H → H. Several Gaussian processes became popular enough to have their own names:
 Gaussian qdistribution is an abstract mathematical construction that represents a "qanalogue" of the normal distribution.
 the qGaussian is an analogue of the Gaussian distribution, in the sense that it maximises the Tsallis entropy, and is one type of Tsallis distribution. Note that this distribution is different from the Gaussian qdistribution above.
One of the main practical uses of the Gaussian law is to model the empirical distributions of many different random variables encountered in practice. In such case a possible extension would be a richer family of distributions, having more than two parameters and therefore being able to fit the empirical distribution more accurately. The examples of such extensions are:
 Pearson distribution — a fourparametric family of probability distributions that extend the normal law to include different skewness and kurtosis values.
Normality tests
Normality tests assess the likelihood that the given data set {x_{1}, …, x_{n}} comes from a normal distribution. Typically the null hypothesis H_{0} is that the observations are distributed normally with unspecified mean μ and variance σ^{2}, versus the alternative H_{a} that the distribution is arbitrary. Many tests (over 40) have been devised for this problem, the more prominent of them are outlined below:
 "Visual" tests are more intuitively appealing but subjective at the same time, as they rely on informal human judgement to accept or reject the null hypothesis.
 QQ plot — is a plot of the sorted values from the data set against the expected values of the corresponding quantiles from the standard normal distribution. That is, it's a plot of point of the form (Φ^{−1}(p_{k}), x_{(k)}), where plotting points p_{k} are equal to p_{k} = (k − α)/(n + 1 − 2α) and α is an adjustment constant, which can be anything between 0 and 1. If the null hypothesis is true, the plotted points should approximately lie on a straight line.
 PP plot — similar to the QQ plot, but used much less frequently. This method consists of plotting the points (Φ(z_{(k)}), p_{k}), where $\backslash scriptstyle\; z\_\{(k)\}\; =\; (x\_\{(k)\}\backslash hat\backslash mu)/\backslash hat\backslash sigma$. For normally distributed data this plot should lie on a 45° line between (0, 0) and (1, 1).
 ShapiroWilk test employs the fact that the line in the QQ plot has the slope of σ. The test compares the least squares estimate of that slope with the value of the sample variance, and rejects the null hypothesis if these two quantities differ significantly.
 Normal probability plot (rankit plot)
 Moment tests:
 D'Agostino's Ksquared test
 Jarque–Bera test
 Empirical distribution function tests:
 Lilliefors test (an adaptation of the Kolmogorov–Smirnov test)
 Anderson–Darling test
Estimation of parameters
It is often the case that we don't know the parameters of the normal distribution, but instead want to estimate them. That is, having a sample (x_{1}, …, x_{n}) from a normal N(μ, σ^{2}) population we would like to learn the approximate values of parameters μ and σ^{2}. The standard approach to this problem is the maximum likelihood method, which requires maximization of the loglikelihood function:
 $$
\ln\mathcal{L}(\mu,\sigma^2) = \sum_{i=1}^n \ln f(x_i;\,\mu,\sigma^2) = \frac{n}{2}\ln(2\pi)  \frac{n}{2}\ln\sigma^2  \frac{1}{2\sigma^2}\sum_{i=1}^n (x_i\mu)^2.
Taking derivatives with respect to μ and σ^{2} and solving the resulting system of first order conditions yields the maximum likelihood estimates:
 $$
\hat{\mu} = \overline{x} \equiv \frac{1}{n}\sum_{i=1}^n x_i, \qquad \hat{\sigma}^2 = \frac{1}{n} \sum_{i=1}^n (x_i  \overline{x})^2.
Estimator $\backslash scriptstyle\backslash hat\backslash mu$ is called the sample mean, since it is the arithmetic mean of all observations. The statistic $\backslash scriptstyle\backslash overline\{x\}$ is complete and sufficient for μ, and therefore by the Lehmann–Scheffé theorem, $\backslash scriptstyle\backslash hat\backslash mu$ is the uniformly minimum variance unbiased (UMVU) estimator.^{[36]} In finite samples it is distributed normally:
 $$
\hat\mu \ \sim\ \mathcal{N}(\mu,\,\,\sigma^2\!\!\;/n).
The variance of this estimator is equal to the μμelement of the inverse Fisher information matrix $\backslash scriptstyle\backslash mathcal\{I\}^\{1\}$. This implies that the estimator is finitesample efficient. Of practical importance is the fact that the standard error of $\backslash scriptstyle\backslash hat\backslash mu$ is proportional to $\backslash scriptstyle1/\backslash sqrt\{n\}$, that is, if one wishes to decrease the standard error by a factor of 10, one must increase the number of points in the sample by a factor of 100. This fact is widely used in determining sample sizes for opinion polls and the number of trials in Monte Carlo simulations.
From the standpoint of the asymptotic theory, $\backslash scriptstyle\backslash hat\backslash mu$ is consistent, that is, it converges in probability to μ as n → ∞. The estimator is also asymptotically normal, which is a simple corollary of the fact that it is normal in finite samples:
 $$
\sqrt{n}(\hat\mu\mu) \ \xrightarrow{d}\ \mathcal{N}(0,\,\sigma^2).
The estimator $\backslash scriptstyle\backslash hat\backslash sigma^2$ is called the sample variance, since it is the variance of the sample (x_{1}, …, x_{n}). In practice, another estimator is often used instead of the $\backslash scriptstyle\backslash hat\backslash sigma^2$. This other estimator is denoted s^{2}, and is also called the sample variance, which represents a certain ambiguity in terminology; its square root s is called the sample standard deviation. The estimator s^{2} differs from $\backslash scriptstyle\backslash hat\backslash sigma^2$ by having (n − 1) instead of n in the denominator (the socalled Bessel's correction):
 $$
s^2 = \frac{n}{n1}\,\hat\sigma^2 = \frac{1}{n1} \sum_{i=1}^n (x_i  \overline{x})^2.
The difference between s^{2} and $\backslash scriptstyle\backslash hat\backslash sigma^2$ becomes negligibly small for large n's. In finite samples however, the motivation behind the use of s^{2} is that it is an unbiased estimator of the underlying parameter σ^{2}, whereas $\backslash scriptstyle\backslash hat\backslash sigma^2$ is biased. Also, by the Lehmann–Scheffé theorem the estimator s^{2} is uniformly minimum variance unbiased (UMVU),^{[36]} which makes it the "best" estimator among all unbiased ones. However it can be shown that the biased estimator $\backslash scriptstyle\backslash hat\backslash sigma^2$ is "better" than the s^{2} in terms of the mean squared error (MSE) criterion. In finite samples both s^{2} and $\backslash scriptstyle\backslash hat\backslash sigma^2$ have scaled chisquared distribution with (n − 1) degrees of freedom:
 $$
s^2 \ \sim\ \frac{\sigma^2}{n1} \cdot \chi^2_{n1}, \qquad \hat\sigma^2 \ \sim\ \frac{\sigma^2}{n} \cdot \chi^2_{n1}\ .
The first of these expressions shows that the variance of s^{2} is equal to 2σ^{4}/(n−1), which is slightly greater than the σσelement of the inverse Fisher information matrix $\backslash scriptstyle\backslash mathcal\{I\}^\{1\}$. Thus, s^{2} is not an efficient estimator for σ^{2}, and moreover, since s^{2} is UMVU, we can conclude that the finitesample efficient estimator for σ^{2} does not exist.
Applying the asymptotic theory, both estimators s^{2} and $\backslash scriptstyle\backslash hat\backslash sigma^2$ are consistent, that is they converge in probability to σ^{2} as the sample size n → ∞. The two estimators are also both asymptotically normal:
 $$
\sqrt{n}(\hat\sigma^2  \sigma^2) \simeq \sqrt{n}(s^2\sigma^2)\ \xrightarrow{d}\ \mathcal{N}(0,\,2\sigma^4).
In particular, both estimators are asymptotically efficient for σ^{2}.
By Cochran's theorem, for normal distributions the sample mean $\backslash scriptstyle\backslash hat\backslash mu$ and the sample variance s^{2} are independent, which means there can be no gain in considering their joint distribution. There is also a reverse theorem: if in a sample the sample mean and sample variance are independent, then the sample must have come from the normal distribution. The independence between $\backslash scriptstyle\backslash hat\backslash mu$ and s can be employed to construct the socalled tstatistic:
 $$
t = \frac{\hat\mu\mu}{s/\sqrt{n}} = \frac{\overline{x}\mu}{\sqrt{\frac{1}{n(n1)}\sum(x_i\overline{x})^2}}\ \sim\ t_{n1}
This quantity t has the Student's tdistribution with (n − 1) degrees of freedom, and it is an ancillary statistic (independent of the value of the parameters). Inverting the distribution of this tstatistics will allow us to construct the confidence interval for μ;^{[37]} similarly, inverting the χ^{2} distribution of the statistic s^{2} will give us the confidence interval for σ^{2}:^{[38]}
 $\backslash begin\{align\}$
& \mu \in \left[\, \hat\mu + t_{n1,\alpha/2}\, \frac{1}{\sqrt{n}}s,\ \ \hat\mu + t_{n1,1\alpha/2}\,\frac{1}{\sqrt{n}}s \,\right] \approx \left[\, \hat\mu  z_{\alpha/2}\frac{1}{\sqrt n}s,\ \ \hat\mu + z_{\alpha/2}\frac{1}{\sqrt n}s \,\right], \\ & \sigma^2 \in \left[\, \frac{(n1)s^2}{\chi^2_{n1,1\alpha/2}},\ \ \frac{(n1)s^2}{\chi^2_{n1,\alpha/2}} \,\right] \approx \left[\, s^2  z_{\alpha/2}\frac{\sqrt{2}}{\sqrt{n}}s^2,\ \ s^2 + z_{\alpha/2}\frac{\sqrt{2}}{\sqrt{n}}s^2 \,\right], \end{align}
where t_{k,p} and χ 2
k,p are the p^{th} quantiles of the t and χ^{2}distributions respectively. These confidence intervals are of the level 1 − α, meaning that the true values μ and σ^{2} fall outside of these intervals with probability α. In practice people usually take α = 5%, resulting in the 95% confidence intervals. The approximate formulas in the display above were derived from the asymptotic distributions of $\backslash scriptstyle\backslash hat\backslash mu$ and s^{2}. The approximate formulas become valid for large values of n, and are more convenient for the manual calculation since the standard normal quantiles z_{α/2} do not depend on n. In particular, the most popular value of α = 5%, results in z_{0.025 = 1.96}.
Bayesian analysis of the normal distribution
Bayesian analysis of normally distributed data is complicated by the many different possibilities that may be considered:
 Either the mean, or the variance, or neither, may be considered a fixed quantity.
 When the variance is unknown, analysis may be done directly in terms of the variance, or in terms of the precision, the reciprocal of the variance. The reason for expressing the formulas in terms of precision is that the analysis of most cases is simplified.
 Both univariate and multivariate cases need to be considered.
 Either conjugate or improper prior distributions may be placed on the unknown variables.
 An additional set of cases occurs in Bayesian linear regression, where in the basic model the data is assumed to be normally distributed, and normal priors are placed on the regression coefficients. The resulting analysis is similar to the basic cases of independent identically distributed data, but more complex.
The formulas for the nonlinearregression cases are summarized in the conjugate prior article.
The sum of two quadratics
Scalar form
The following auxiliary formula is useful for simplifying the posterior update equations, which otherwise become fairly tedious.
 $a(xy)^2\; +\; b(xz)^2\; =\; (a\; +\; b)\backslash left(x\; \; \backslash frac\{ay+bz\}\{a+b\}\backslash right)^2\; +\; \backslash frac\{ab\}\{a+b\}(yz)^2$
This equation rewrites the sum of two quadratics in x by expanding the squares, grouping the terms in x, and completing the square. Note the following about the complex constant factors attached to some of the terms:
 The factor $\backslash frac\{ay+bz\}\{a+b\}$ has the form of a weighted average of y and z.
 $\backslash frac\{ab\}\{a+b\}\; =\; \backslash frac\{1\}\{\backslash frac\{1\}\{a\}+\backslash frac\{1\}\{b\}\}\; =\; (a^\{1\}\; +\; b^\{1\})^\{1\}.$ This shows that this factor can be thought of as resulting from a situation where the reciprocals of quantities a and b add directly, so to combine a and b themselves, it's necessary to reciprocate, add, and reciprocate the result again to get back into the original units. This is exactly the sort of operation performed by the harmonic mean, so it is not surprising that $\backslash frac\{ab\}\{a+b\}$ is onehalf the harmonic mean of a and b.
Vector form
A similar formula can be written for the sum of two vector quadratics: If x, y, z are vectors of length k, and A and B are symmetric, invertible matrices of size $k\backslash times\; k$, then
 $(\backslash mathbf\{y\}\backslash mathbf\{x\})\text{'}\backslash mathbf\{A\}(\backslash mathbf\{y\}\backslash mathbf\{x\})\; +\; (\backslash mathbf\{x\}\backslash mathbf\{z\})\text{'}\backslash mathbf\{B\}(\backslash mathbf\{x\}\backslash mathbf\{z\})\; =\; (\backslash mathbf\{x\}\; \; \backslash mathbf\{c\})\text{'}(\backslash mathbf\{A\}+\backslash mathbf\{B\})(\backslash mathbf\{x\}\; \; \backslash mathbf\{c\})\; +\; (\backslash mathbf\{y\}\; \; \backslash mathbf\{z\})\text{'}(\backslash mathbf\{A\}^\{1\}\; +\; \backslash mathbf\{B\}^\{1\})^\{1\}(\backslash mathbf\{y\}\; \; \backslash mathbf\{z\})$
where
 $\backslash mathbf\{c\}\; =\; (\backslash mathbf\{A\}\; +\; \backslash mathbf\{B\})^\{1\}(\backslash mathbf\{A\}\backslash mathbf\{y\}\; +\; \backslash mathbf\{B\}\backslash mathbf\{z\})$
Note that the form x′ A x is called a quadratic form and is a scalar:
 $\backslash mathbf\{x\}\text{'}\backslash mathbf\{A\}\backslash mathbf\{x\}\; =\; \backslash sum\_\{i,j\}a\_\{ij\}\; x\_i\; x\_j$
In other words, it sums up all possible combinations of products of pairs of elements from x, with a separate coefficient for each. In addition, since $x\_i\; x\_j\; =\; x\_j\; x\_i$, only the sum $a\_\{ij\}\; +\; a\_\{ji\}$ matters for any offdiagonal elements of A, and there is no loss of generality in assuming that A is symmetric. Furthermore, if A is symmetric, then the form $\backslash mathbf\{x\}\text{'}\backslash mathbf\{A\}\backslash mathbf\{y\}\; =\; \backslash mathbf\{y\}\text{'}\backslash mathbf\{A\}\backslash mathbf\{x\}$ .
The sum of differences from the mean
Another useful formula is as follows:
 $\backslash sum\_\{i=1\}^n\; (x\_i\backslash mu)^2\; =\; \backslash sum\_\{i=1\}^n(x\_i\backslash bar\{x\})^2\; +\; n(\backslash bar\{x\}\; \backslash mu)^2$
where $\backslash bar\{x\}\; =\; \backslash frac\{1\}\{n\}\backslash sum\_\{i=1\}^n\; x\_i.$
With known variance
For a set of i.i.d. normally distributed data points X of size n where each individual point x follows $x\; \backslash sim\; \backslash mathcal\{N\}(\backslash mu,\; \backslash sigma^2)$ with known variance σ^{2}, the conjugate prior distribution is also normally distributed.
This can be shown more easily by rewriting the variance as the precision, i.e. using τ = 1/σ^{2}. Then if $x\; \backslash sim\; \backslash mathcal\{N\}(\backslash mu,\; \backslash tau)$ and $\backslash mu\; \backslash sim\; \backslash mathcal\{N\}(\backslash mu\_0,\; \backslash tau\_0),$ we proceed as follows.
First, the likelihood function is (using the formula above for the sum of differences from the mean):
 $\backslash begin\{align\}$
p(\mathbf{X}\mu,\tau) &= \prod_{i=1}^n \sqrt{\frac{\tau}{2\pi}} \exp\left(\frac{1}{2}\tau(x_i\mu)^2\right) \\ &= \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left(\frac{1}{2}\tau \sum_{i=1}^n (x_i\mu)^2\right) \\ &= \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left[\frac{1}{2}\tau \left(\sum_{i=1}^n(x_i\bar{x})^2 + n(\bar{x} \mu)^2\right)\right]. \end{align}
Then, we proceed as follows:
 $\backslash begin\{align\}$
p(\mu\mathbf{X}) &\propto p(\mathbf{X}\mu) p(\mu) \\ & = \left(\frac{\tau}{2\pi}\right)^{\frac{n}{2}} \exp\left[\frac{1}{2}\tau \left(\sum_{i=1}^n(x_i\bar{x})^2 + n(\bar{x} \mu)^2\right)\right] \sqrt{\frac{\tau_0}{2\pi}} \exp\left(\frac{1}{2}\tau_0(\mu\mu_0)^2\right) \\ &\propto \exp\left(\frac{1}{2}\left(\tau\left(\sum_{i=1}^n(x_i\bar{x})^2 + n(\bar{x} \mu)^2\right) + \tau_0(\mu\mu_0)^2\right)\right) \\ &\propto \exp\left(\frac{1}{2} \left(n\tau(\bar{x}\mu)^2 + \tau_0(\mu\mu_0)^2 \right)\right) \\ &= \exp\left(\frac{1}{2}(n\tau + \tau_0)\left(\mu  \dfrac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0}\right)^2 + \frac{n\tau\tau_0}{n\tau+\tau_0}(\bar{x}  \mu_0)^2\right) \\ &\propto \exp\left(\frac{1}{2}(n\tau + \tau_0)\left(\mu  \dfrac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0}\right)^2\right) \end{align}
In the above derivation, we used the formula above for the sum of two quadratics and eliminated all constant factors not involving μ. The result is the kernel of a normal distribution, with mean $\backslash frac\{n\backslash tau\; \backslash bar\{x\}\; +\; \backslash tau\_0\backslash mu\_0\}\{n\backslash tau\; +\; \backslash tau\_0\}$ and precision $n\backslash tau\; +\; \backslash tau\_0$, i.e.
 $p(\backslash mu\backslash mathbf\{X\})\; \backslash sim\; \backslash mathcal\{N\}\backslash left(\backslash frac\{n\backslash tau\; \backslash bar\{x\}\; +\; \backslash tau\_0\backslash mu\_0\}\{n\backslash tau\; +\; \backslash tau\_0\},\; n\backslash tau\; +\; \backslash tau\_0\backslash right)$
This can be written as a set of Bayesian update equations for the posterior parameters in terms of the prior parameters:
 $\backslash begin\{align\}$
\tau_0' &= \tau_0 + n\tau \\ \mu_0' &= \frac{n\tau \bar{x} + \tau_0\mu_0}{n\tau + \tau_0} \\ \bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i \end{align}
That is, to combine n data points with total precision of nτ (or equivalently, total variance of n/σ^{2}) and mean of values $\backslash bar\{x\}$, derive a new total precision simply by adding the total precision of the data to the prior total precision, and form a new mean through a precisionweighted average, i.e. a weighted average of the data mean and the prior mean, each weighted by the associated total precision. This makes logical sense if the precision is thought of as indicating the certainty of the observations: In the distribution of the posterior mean, each of the input components is weighted by its certainty, and the certainty of this distribution is the sum of the individual certainties. (For the intuition of this, compare the expression "the whole is (or is not) greater than the sum of its parts". In addition, consider that the knowledge of the posterior comes from a combination of the knowledge of the prior and likelihood, so it makes sense that we are more certain of it than of either of its components.)
The above formula reveals why it is more convenient to do Bayesian analysis of conjugate priors for the normal distribution in terms of the precision. The posterior precision is simply the sum of the prior and likelihood precisions, and the posterior mean is computed through a precisionweighted average, as described above. The same formulas can be written in terms of variance by reciprocating all the precisions, yielding the more ugly formulas
 $\backslash begin\{align\}$
{\sigma^2_0}' &= \frac{1}{\frac{n}{\sigma^2} + \frac{1}{\sigma_0^2}} \\ \mu_0' &= \frac{\frac{n\bar{x}}{\sigma^2} + \frac{\mu_0}{\sigma_0^2}}{\frac{n}{\sigma^2} + \frac{1}{\sigma_0^2}} \\ \bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i \end{align}
With known mean
For a set of i.i.d. normally distributed data points X of size n where each individual point x follows $x\; \backslash sim\; \backslash mathcal\{N\}(\backslash mu,\; \backslash sigma^2)$ with known mean μ, the conjugate prior of the variance has an inverse gamma distribution or a scaled inverse chisquared distribution. The two are equivalent except for having different parameterizations. Although the inverse gamma is more commonly used, we use the scaled inverse chisquared for the sake of convenience. The prior for σ^{2} is as follows:
 $p(\backslash sigma^2\backslash nu\_0,\backslash sigma\_0^2)\; =\; \backslash frac\{(\backslash sigma\_0^2\backslash frac\{\backslash nu\_0\}\{2\})^\{\backslash frac\{\backslash nu\_0\}\{2\}\}\}\{\backslash Gamma\backslash left(\backslash frac\{\backslash nu\_0\}\{2\}\; \backslash right)\}~\backslash frac\{\backslash exp\backslash left[\; \backslash frac\{\backslash nu\_0\; \backslash sigma\_0^2\}\{2\; \backslash sigma^2\}\backslash right]\}\{(\backslash sigma^2)^\{1+\backslash frac\{\backslash nu\_0\}\{2\}\}\}\; \backslash propto\; \backslash frac\{\backslash exp\backslash left[\; \backslash frac\{\backslash nu\_0\; \backslash sigma\_0^2\}\{2\; \backslash sigma^2\}\backslash right]\}\{(\backslash sigma^2)^\{1+\backslash frac\{\backslash nu\_0\}\{2\}\}\}$
The likelihood function from above, written in terms of the variance, is:
 $\backslash begin\{align\}$
p(\mathbf{X}\mu,\sigma^2) &= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[\frac{1}{2\sigma^2} \sum_{i=1}^n (x_i\mu)^2\right] \\ &= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[\frac{S}{2\sigma^2}\right] \end{align}
where
 $S\; =\; \backslash sum\_\{i=1\}^n\; (x\_i\backslash mu)^2.$
Then:
 $\backslash begin\{align\}$
p(\sigma^2\mathbf{X}) &\propto p(\mathbf{X}\sigma^2) p(\sigma^2) \\ &= \left(\frac{1}{2\pi\sigma^2}\right)^{\frac{n}{2}} \exp\left[\frac{S}{2\sigma^2}\right] \frac{(\sigma_0^2\frac{\nu_0}{2})^{\frac{\nu_0}{2}}}{\Gamma\left(\frac{\nu_0}{2} \right)}~\frac{\exp\left[ \frac{\nu_0 \sigma_0^2}{2 \sigma^2}\right]}{(\sigma^2)^{1+\frac{\nu_0}{2}}} \\ &\propto \left(\frac{1}{\sigma^2}\right)^{\frac{n}{2}} \frac{1}{(\sigma^2)^{1+\frac{\nu_0}{2}}} \exp\left[\frac{S}{2\sigma^2} + \frac{\nu_0 \sigma_0^2}{2 \sigma^2}\right] \\ &= \frac{1}{(\sigma^2)^{1+\frac{\nu_0+n}{2}}} \exp\left[\frac{\nu_0 \sigma_0^2 + S}{2\sigma^2}\right] \end{align}
The above is also a scaled inverse chisquared distribution where
 $\backslash begin\{align\}$
\nu_0' &= \nu_0 + n \\ \nu_0'{\sigma_0^2}' &= \nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i\mu)^2 \end{align}
or equivalently
 $\backslash begin\{align\}$
\nu_0' &= \nu_0 + n \\ {\sigma_0^2}' &= \frac{\nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i\mu)^2}{\nu_0+n} \end{align}
Reparameterizing in terms of an inverse gamma distribution, the result is:
 $\backslash begin\{align\}$
\alpha' &= \alpha + \frac{n}{2} \\ \beta' &= \beta + \frac{\sum_{i=1}^n (x_i\mu)^2}{2} \end{align}
With unknown mean and unknown variance
For a set of i.i.d. normally distributed data points X of size n where each individual point x follows $x\; \backslash sim\; \backslash mathcal\{N\}(\backslash mu,\; \backslash sigma^2)$ with unknown mean μ and unknown variance σ^{2}, a combined (multivariate) conjugate prior is placed over the mean and variance, consisting of a normalinversegamma distribution. Logically, this originates as follows:
 From the analysis of the case with unknown mean but known variance, we see that the update equations involve sufficient statistics computed from the data consisting of the mean of the data points and the total variance of the data points, computed in turn from the known variance divided by the number of data points.
 From the analysis of the case with unknown variance but known mean, we see that the update equations involve sufficient statistics over the data consisting of the number of data points and sum of squared deviations.
 Keep in mind that the posterior update values serve as the prior distribution when further data is handled. Thus, we should logically think of our priors in terms of the sufficient statistics just described, with the same semantics kept in mind as much as possible.
 To handle the case where both mean and variance are unknown, we could place independent priors over the mean and variance, with fixed estimates of the average mean, total variance, number of data points used to compute the variance prior, and sum of squared deviations. Note however that in reality, the total variance of the mean depends on the unknown variance, and the sum of squared deviations that goes into the variance prior (appears to) depend on the unknown mean. In practice, the latter dependence is relatively unimportant: Shifting the actual mean shifts the generated points by an equal amount, and on average the squared deviations will remain the same. This is not the case, however, with the total variance of the mean: As the unknown variance increases, the total variance of the mean will increase proportionately, and we would like to capture this dependence.
 This suggests that we create a conditional prior of the mean on the unknown variance, with a hyperparameter specifying the mean of the pseudoobservations associated with the prior, and another parameter specifying the number of pseudoobservations. This number serves as a scaling parameter on the variance, making it possible to control the overall variance of the mean relative to the actual variance parameter. The prior for the variance also has two hyperparameters, one specifying the sum of squared deviations of the pseudoobservations associated with the prior, and another specifying once again the number of pseudoobservations. Note that each of the priors has a hyperparameter specifying the number of pseudoobservations, and in each case this controls the relative variance of that prior. These are given as two separate hyperparameters so that the variance (aka the confidence) of the two priors can be controlled separately.
 This leads immediately to the normalinversegamma distribution, which is the product of the two distributions just defined, with conjugate priors used (an inverse gamma distribution over the variance, and a normal distribution over the mean, conditional on the variance) and with the same four parameters just defined.
The priors are normally defined as follows:
 $\backslash begin\{align\}$
p(\mu\sigma^2; \mu_0, n_0) &\sim \mathcal{N}(\mu_0,\sigma^2/n_0) \\ p(\sigma^2; \nu_0,\sigma_0^2) &\sim I\chi^2(\nu_0,\sigma_0^2) = IG(\nu_0/2, \nu_0\sigma_0^2/2) \end{align}
The update equations can be derived, and look as follows:
 $\backslash begin\{align\}$
\bar{x} &= \frac{1}{n}\sum_{i=1}^n x_i \\ \mu_0' &= \frac{n_0\mu_0 + n\bar{x}}{n_0 + n} \\ n_0' &= n_0 + n \\ \nu_0' &= \nu_0 + n \\ \nu_0'{\sigma_0^2}' &= \nu_0 \sigma_0^2 + \sum_{i=1}^n (x_i\bar{x})^2 + \frac{n_0 n}{n_0 + n}(\mu_0  \bar{x})^2 \end{align}
The respective numbers of pseudoobservations add the number of actual observations to them. The new mean hyperparameter is once again a weighted average, this time weighted by the relative numbers of observations. Finally, the update for $\backslash nu\_0\text{'}\{\backslash sigma\_0^2\}\text{'}$ is similar to the case with known mean, but in this case the sum of squared deviations is taken with respect to the observed data mean rather than the true mean, and as a result a new "interaction term" needs to be added to take care of the additional error source stemming from the deviation between prior and data mean.
Proof is as follows.
The prior distributions are
 $\backslash begin\{align\}$
p(\mu\sigma^2; \mu_0, n_0) &\sim \mathcal{N}(\mu_0,\sigma^2/n_0) = \frac{1}{\sqrt{2\pi\frac{\sigma^2}{n_0}}} \exp\left(\frac{n_0}{2\sigma^2}(\mu\mu_0)^2\right) \\ &\propto (\sigma^2)^{1/2} \exp\left(\frac{n_0}{2\sigma^2}(\mu\mu_0)^2\right) \\ p(\sigma^2; \nu_0,\sigma_0^2) &\sim I\chi^2(\nu_0,\sigma_0^2) = IG(\nu_0/2, \nu_0\sigma_0^2/2) \\ &= \frac{(\sigma_0^2\nu_0/2)^{\nu_0/2}}{\Gamma(\nu_0/2)}~\frac{\exp\left[ \frac{\nu_0 \sigma_0^2}{2 \sigma^2}\right]}{(\sigma^2)^{1+\nu_0/2}} \\ &\propto {(\sigma^2)^{(1+\nu_0/2)}} \exp\left[ \frac{\nu_0 \sigma_0^2}{2 \sigma^2}\right] \end{align}
Therefore, the joint prior is
 $\backslash begin\{align\}$
p(\mu,\sigma^2; \mu_0, n_0, \nu_0,\sigma_0^2) &= p(\mu\sigma^2; \mu_0, n_0)\,p(\sigma^2; \nu_0,\sigma_0^2) \\ &\propto (\sigma^2)^{(\nu_0+3)/2} \exp\left[\frac{1}{2\sigma^2}\left(\nu_0\sigma_0^2 + n_0(\mu\mu_0)^2\right)\right] \end{align}
The likelihood function from the section above with known variance is:
 $\backslash begin\{align\}$
p(\mathbf{X}\mu,\sigma^2) &= \left(\frac{1}{2\pi\sigma^2}\right)^{n/2} \exp\left[\frac{1}{2\sigma^2} \left(\sum_{i=1}^n(x_i \mu)^2\right)\right] \end{align}
Writing it in terms of variance rather than precision, we get:
 $\backslash begin\{align\}$
p(\mathbf{X}\mu,\sigma^2) &= \left(\frac{1}{2\pi\sigma^2}\right)^{n/2} \exp\left[\frac{1}{2\sigma^2} \left(\sum_{i=1}^n(x_i\bar{x})^2 + n(\bar{x} \mu)^2\right)\right] \\ &\propto {\sigma^2}^{n/2} \exp\left[\frac{1}{2\sigma^2} \left(S + n(\bar{x} \mu)^2\right)\right] \end{align}
where $S\; =\; \backslash sum\_\{i=1\}^n(x\_i\backslash bar\{x\})^2.$
Therefore, the posterior is (dropping the hyperparameters as conditioning factors):
 $\backslash begin\{align\}$
p(\mu,\sigma^2\mathbf{X}) & \propto p(\mu,\sigma^2) \, p(\mathbf{X}\mu,\sigma^2) \\ & \propto (\sigma^2)^{(\nu_0+3)/2} \exp\left[\frac{1}{2\sigma^2}\left(\nu_0\sigma_0^2 + n_0(\mu\mu_0)^2\right)\right] {\sigma^2}^{n/2} \exp\left[\frac{1}{2\sigma^2} \left(S + n(\bar{x} \mu)^2\right)\right] \\ &= (\sigma^2)^{(\nu_0+n+3)/2} \exp\left[\frac{1}{2\sigma^2}\left(\nu_0\sigma_0^2 + S + n_0(\mu\mu_0)^2 + n(\bar{x} \mu)^2\right)\right] \\ &= (\sigma^2)^{(\nu_0+n+3)/2} \exp\left[\frac{1}{2\sigma^2}\left(\nu_0\sigma_0^2 + S + \frac{n_0 n}{n_0+n}(\mu_0\bar{x})^2 + (n_0+n)\left(\mu\frac{n_0\mu_0 + n\bar{x}}{n_0 + n}\right)^2\right)\right] \\ & \propto (\sigma^2)^{1/2} \exp\left[\frac{n_0+n}{2\sigma^2}\left(\mu\frac{n_0\mu_0 + n\bar{x}}{n_0 + n}\right)^2\right] \\ & \quad\times (\sigma^2)^{(\nu_0/2+n/2+1)} \exp\left[\frac{1}{2\sigma^2}\left(\nu_0\sigma_0^2 + S + \frac{n_0 n}{n_0+n}(\mu_0\bar{x})^2\right)\right] \\ & = \mathcal{N}_{\mu\sigma^2}\left(\frac{n_0\mu_0 + n\bar{x}}{n_0 + n}, \frac{\sigma^2}{n_0+n}\right) \cdot {\rm IG}_{\sigma^2}\left(\frac12(\nu_0+n), \frac12\left(\nu_0\sigma_0^2 + S + \frac{n_0 n}{n_0+n}(\mu_0\bar{x})^2\right)\right). \end{align}
In other words, the posterior distribution has the form of a product of a normal distribution over p(μσ^{2}) times an inverse gamma distribution over p(σ^{2}), with parameters that are the same as the update equations above.
Occurrence
The occurrence of normal distribution in practical problems can be loosely classified into three categories:
 Exactly normal distributions;
 Approximately normal laws, for example when such approximation is justified by the central limit theorem; and
 Distributions modeled as normal – the normal distribution being the distribution with maximum entropy for a given mean and variance.
Exact normality
Certain quantities in physics are distributed normally, as was first demonstrated by James Clerk Maxwell. Examples of such quantities are:
 Velocities of the molecules in the ideal gas. More generally, velocities of the particles in any system in thermodynamic equilibrium will have normal distribution, due to the maximum entropy principle.
 Probability density function of a ground state in a quantum harmonic oscillator.
 The position of a particle that experiences diffusion. If initially the particle is located at a specific point (that is its probability distribution is the dirac delta function), then after time t its location is described by a normal distribution with variance t, which satisfies the diffusion equation #REDIRECT Template:Sfrac f(x,t) =
 REDIRECT Template:Sfrac
 REDIRECT Template:Sfrac f(x,t). If the initial location is given by a certain density function g(x), then the density at time t is the convolution of g and the normal PDF.
Approximate normality
Approximately normal distributions occur in many situations, as explained by the central limit theorem. When the outcome is produced by many small effects acting additively and independently, its distribution will be close to normal. The normal approximation will not be valid if the effects act multiplicatively (instead of additively), or if there is a single external influence that has a considerably larger magnitude than the rest of the effects.
 In counting problems, where the central limit theorem includes a discretetocontinuum approximation and where infinitely divisible and decomposable distributions are involved, such as
 Binomial random variables, associated with binary response variables;
 Poisson random variables, associated with rare events;
 Thermal light has a Bose–Einstein distribution on very short time scales, and a normal distribution on longer timescales due to the central limit theorem.
Assumed normality
I can only recognize the occurrence of the normal curve – the Laplacian curve of errors – as a very abnormal phenomenon. It is roughly approximated to in certain distributions; for this reason, and on account for its beautiful simplicity, we may, perhaps, use it as a first approximation, particularly in theoretical investigations.
There are statistical methods to empirically test that assumption, see the above Normality tests section.
 In biology, the logarithm of various variables tend to have a normal distribution, that is, they tend to have a lognormal distribution (after separation on male/female subpopulations), with examples including:
 Measures of size of living tissue (length, height, skin area, weight);^{[39]}
 The length of inert appendages (hair, claws, nails, teeth) of biological specimens, in the direction of growth; presumably the thickness of tree bark also falls under this category;
 Certain physiological measurements, such as blood pressure of adult humans.
 In finance, in particular the Black–Scholes model, changes in the logarithm of exchange rates, price indices, and stock market indices are assumed normal (these variables behave like compound interest, not like simple interest, and so are multiplicative). Some mathematicians such as Benoît Mandelbrot have argued that logLevy distributions, which possesses heavy tails would be a more appropriate model, in particular for the analysis for stock market crashes.
 Measurement errors in physical experiments are often modeled by a normal distribution. This use of a normal distribution does not imply that one is assuming the measurement errors are normally distributed, rather using the normal distribution produces the most conservative predictions possible given only knowledge about the mean and variance of the errors.^{[40]}
 In standardized testing, results can be made to have a normal distribution by either selecting the number and difficulty of questions (as in the IQ test) or transforming the raw test scores into "output" scores by fitting them to the normal distribution. For example, the SAT's traditional range of 200–800 is based on a normal distribution with a mean of 500 and a standard deviation of 100.
 Many scores are derived from the normal distribution, including percentile ranks ("percentiles" or "quantiles"), normal curve equivalents, stanines, zscores, and Tscores. Additionally, some behavioral statistical procedures assume that scores are normally distributed; for example, ttests and ANOVAs. Bell curve grading assigns relative grades based on a normal distribution of scores.
 In hydrology the distribution of long duration river discharge or rainfall, e.g. monthly and yearly totals, is often thought to be practically normal according to the central limit theorem.^{[41]} The blue picture illustrates an example of fitting the normal distribution to ranked October rainfalls showing the 90% confidence belt based on the binomial distribution. The rainfall data are represented by plotting positions as part of the cumulative frequency analysis.
Generating values from normal distribution
In computer simulations, especially in applications of the MonteCarlo method, it is often desirable to generate values that are normally distributed. The algorithms listed below all generate the standard normal deviates, since a N(μ, σ2
) can be generated as X = μ + σZ, where Z is standard normal. All these algorithms rely on the availability of a random number generator U capable of producing uniform random variates.
 The most straightforward method is based on the probability integral transform property: if U is distributed uniformly on (0,1), then Φ^{−1}(U) will have the standard normal distribution. The drawback of this method is that it relies on calculation of the probit function Φ^{−1}, which cannot be done analytically. Some approximate methods are described in Hart (1968) and in the erf article. Wichura^{[42]} gives a fast algorithm for computing this function to 16 decimal places, which is used by R to compute random variates of the normal distribution.
 An easy to program approximate approach, that relies on the central limit theorem, is as follows: generate 12 uniform U(0,1) deviates, add them all up, and subtract 6 – the resulting random variable will have approximately standard normal distribution. In truth, the distribution will be Irwin–Hall, which is a 12section eleventhorder polynomial approximation to the normal distribution. This random deviate will have a limited range of (−6, 6).^{[43]}
 The Box–Muller method uses two independent random numbers U and V distributed uniformly on (0,1). Then the two random variables X and Y
 $\backslash begin\{align\}$
 Marsaglia polar method is a modification of the Box–Muller method algorithm, which does not require computation of functions sin() and cos(). In this method U and V are drawn from the uniform (−1,1) distribution, and then S = U^{2} + V^{2} is computed. If S is greater or equal to one then the method starts over, otherwise two quantities
 $$
 The Ratio method^{[44]} is a rejection method. The algorithm proceeds as follows:
 Generate two independent uniform deviates U and V;
 Compute X = √8/e (V − 0.5)/U;
 Optional: if X^{2} ≤ 5 − 4e^{1/4}U then accept X and terminate algorithm;
 Optional: if X^{2} ≥ 4e^{−1.35}/U + 1.4 then reject X and start over from step 1;
 If X^{2} ≤ −4 lnU then accept X, otherwise start over the algorithm.
 The ziggurat algorithm^{[45]} is faster than the Box–Muller transform and still exact. In about 97% of all cases it uses only two random numbers, one random integer and one random uniform, one multiplication and an iftest. Only in 3% of the cases, where the combination of those two falls outside the "core of the ziggurat" (a kind of rejection sampling using logarithms), do exponentials and more uniform random numbers have to be employed.
 There is also some investigation^{[46]} into the connection between the fast Hadamard transform and the normal distribution, since the transform employs just addition and subtraction and by the central limit theorem random numbers from almost any distribution will be transformed into the normal distribution. In this regard a series of Hadamard transforms can be combined with random permutations to turn arbitrary data sets into a normally distributed data.
Numerical approximations for the normal CDF
The standard normal CDF is widely used in scientific and statistical computing. The values Φ(x) may be approximated very accurately by a variety of methods, such as numerical integration, Taylor series, asymptotic series and continued fractions. Different approximations are used depending on the desired level of accuracy.
 26.2.17):
 $$
 Hart (1968) lists almost a hundred of rational function approximations for the erfc() function. His algorithms vary in the degree of complexity and the resulting precision, with maximum absolute precision of 24 digits. An algorithm by West (2009) combines Hart's algorithm 5666 with a continued fraction approximation in the tail to provide a fast computation algorithm with a 16digit precision.
 Cody (1969) after recalling Hart68 solution is not suited for erf, gives a solution for both erf and erfc, with maximal relative error bound, via Rational Chebyshev Approximation.
 Marsaglia (2004) suggested a simple algorithm^{[nb 1]} based on the Taylor series expansion
 $$
 The GNU Scientific Library calculates values of the standard normal CDF using Hart's algorithms and approximations with Chebyshev polynomials.
History
It has been suggested that this section be split into a new article titled History of the normal distribution. (Discuss) Proposed since May 2013. 
Development
Some authors^{[47]}^{[48]} attribute the credit for the discovery of the normal distribution to de Moivre, who in 1738^{[nb 2]} published in the second edition of his "The Doctrine of Chances" the study of the coefficients in the binomial expansion of (a + b)^{n}. De Moivre proved that the middle term in this expansion has the approximate magnitude of $\backslash scriptstyle\; 2/\backslash sqrt\{2\backslash pi\; n\}$, and that "If m or ½n be a Quantity infinitely great, then the Logarithm of the Ratio, which a Term distant from the middle by the Interval ℓ, has to the middle Term, is $\backslash scriptstyle\; \backslash frac\{2\backslash ell\backslash ell\}\{n\}$."^{[49]} Although this theorem can be interpreted as the first obscure expression for the normal probability law, Stigler points out that de Moivre himself did not interpret his results as anything more than the approximate rule for the binomial coefficients, and in particular de Moivre lacked the concept of the probability density function.^{[50]}
In 1809 Gauss published his monograph "Theoria motus corporum coelestium in sectionibus conicis solem ambientium" where among other things he introduces several important statistical concepts, such as the method of least squares, the method of maximum likelihood, and the normal distribution. Gauss used M, M′, M′′, … to denote the measurements of some unknown quantity V, and sought the "most probable" estimator: the one that maximizes the probability φ(M−V) · φ(M′−V) · φ(M′′−V) · … of obtaining the observed experimental results. In his notation φΔ is the probability law of the measurement errors of magnitude Δ. Not knowing what the function φ is, Gauss requires that his method should reduce to the wellknown answer: the arithmetic mean of the measured values.^{[nb 3]} Starting from these principles, Gauss demonstrates that the only law that rationalizes the choice of arithmetic mean as an estimator of the location parameter, is the normal law of errors:^{[51]}
$$
\varphi\mathit{\Delta} = \frac{h}{\surd\pi}\, e^{\mathrm{hh}\Delta\Delta},
where h is "the measure of the precision of the observations". Using this normal law as a generic model for errors in the experiments, Gauss formulates what is now known as the nonlinear weighted least squares (NWLS) method.^{[52]}
Although Gauss was the first to suggest the normal distribution law, Laplace made significant contributions.^{[nb 4]} It was Laplace who first posed the problem of aggregating several observations in 1774,^{[53]} although his own solution led to the Laplacian distribution. It was Laplace who first calculated the value of the integral ∫ e^{−t ²}dt = √π in 1782, providing the normalization constant for the normal distribution.^{[54]} Finally, it was Laplace who in 1810 proved and presented to the Academy the fundamental central limit theorem, which emphasized the theoretical importance of the normal distribution.^{[55]}
It is of interest to note that in 1809 an American mathematician Adrain published two derivations of the normal probability law, simultaneously and independently from Gauss.^{[56]} His works remained largely unnoticed by the scientific community, until in 1871 they were "rediscovered" by Abbe.^{[57]}
In the middle of the 19th century Maxwell demonstrated that the normal distribution is not just a convenient mathematical tool, but may also occur in natural phenomena:^{[58]} "The number of particles whose velocity, resolved in a certain direction, lies between x and x + dx is
 $$
\mathrm{N}\; \frac{1}{\alpha\;\sqrt\pi}\; e^{\frac{x^2}{\alpha^2}}dx
Naming
Since its introduction, the normal distribution has been known by many different names: the law of error, the law of facility of errors, Laplace's second law, Gaussian law, etc. Gauss himself apparently coined the term with reference to the "normal equations" involved in its applications, with normal having its technical meaning of orthogonal rather than "usual".^{[59]} However, by the end of the 19th century some authors^{[nb 5]} had started using the name normal distribution, where the word "normal" was used as an adjective – the term now being seen as a reflection of the fact that this distribution was seen as typical, common – and thus "normal". Peirce (one of those authors) once defined "normal" thus: "...the 'normal' is not the average (or any other kind of mean) of what actually occurs, but of what would, in the long run, occur under certain circumstances."^{[60]} Around the turn of the 20th century Pearson popularized the term normal as a designation for this distribution.^{[61]}
Many years ago I called the Laplace–Gaussian curve the normal curve, which name, while it avoids an international question of priority, has the disadvantage of leading people to believe that all other distributions of frequency are in one sense or another 'abnormal'.
Also, it was Pearson who first wrote the distribution in terms of the standard deviation σ as in modern notation. Soon after this, in year 1915, Fisher added the location parameter to the formula for normal distribution, expressing it in the way it is written nowadays:
 $df\; =\; \backslash frac\{1\}\{\backslash sigma\backslash sqrt\{2\backslash pi\}\}e^\{\backslash frac\{(xm)^2\}\{2\backslash sigma^2\}\}dx$
The term "standard normal", which denotes the normal distribution with zero mean and unit variance came into general use around 1950s, appearing in the popular textbooks by P.G. Hoel (1947) "Introduction to mathematical statistics" and A.M. Mood (1950) "Introduction to the theory of statistics".^{[62]}
When the name is used, the "Gaussian distribution" was named after Carl Friedrich Gauss, who introduced the distribution in 1809 as a way of rationalizing the method of least squares as outlined above. Among English speakers, both "normal distribution" and "Gaussian distribution" are in common use, with different terms preferred by different communities.
See also
 Behrens–Fisher problem—the longstanding problem of testing whether two normal samples with different variances have same means;
 Bhattacharyya distance – method used to separate mixtures of normal distributions
 Erdős–Kac theorem—on the occurrence of the normal distribution in number theory
 Gaussian blur—convolution, which uses the normal distribution as a kernel
 Sum of normally distributed random variables
 Normally distributed and uncorrelated does not imply independent
 Tweedie distributions—The normal distribution is a member of the family of Tweedie exponential dispersion models
 Ztest — using the normal distribution
Notes
Citations
References
 In particular, the entries for "Error, law of error, theory of errors, etc.".
 Template:Springer
 Translated by Stephen M. Stigler in Statistical Science 1 (3), 1986: 2245476.
External links
Commons has media related to Normal distribution. 
 Template:Springer
 Normal Distribution Video Tutorial Part 12
 Index Funds Advisors

Template:ProbDistributions