Geometric mean

related topics
{math, number, function}
{rate, high, increase}
{style, bgcolor, rowspan}

The geometric mean, in mathematics, is a type of mean or average, which indicates the central tendency or typical value of a set of numbers. It is similar to the arithmetic mean, which is what most people think of with the word "average", except that the numbers are multiplied and then the nth root (where n is the count of numbers in the set) of the resulting product is taken.

For instance, the geometric mean of two numbers, say 2 and 8, is just the square root of their product; that is 22 × 8 = 4. As another example, the geometric mean of three numbers 1, ½, ¼ is the cube root of their product (1/8), which is 1/2; that is 31 × ½ × ¼ = ½ .

The geometric mean can also be understood in terms of geometry. The geometric mean of two numbers, a and b, is the length of one side of a square whose area is equal to the area of a rectangle with sides of lengths a and b. Similarly, the geometric mean of three numbers, a, b, and c, is the length of one side of a cube whose volume is the same as that of a right cuboid with sides whose lengths are equal to the three given numbers.

The geometric mean only applies to positive numbers.[1] It is also often used for a set of numbers whose values are meant to be multiplied together or are exponential in nature, such as data on the growth of the human population or interest rates of a financial investment. The geometric mean is also one of the three classic Pythagorean means, together with the aforementioned arithmetic mean and the harmonic mean.

Contents

Calculation

The geometric mean of a data set \{a_1,a_2 , \ldots,a_n\} is given by:

The geometric mean of a data set is less than or equal to the data set's arithmetic mean (the two means are equal if and only if all members of the data set are equal). This allows the definition of the arithmetic-geometric mean, a mixture of the two which always lies in between.

Full article ▸

related documents
Zeta distribution
Degenerate distribution
Iteration
Bernoulli process
Pseudometric space
Heap (data structure)
Fibonacci coding
Bijection
Waring's problem
Alexandroff extension
Static code analysis
Domain (mathematics)
Extractor
Algebraic extension
Alternating group
Binary operation
Closed set
Byte-order mark
Currying
Residue (complex analysis)
Differential cryptanalysis
General number field sieve
Hamming distance
Subtraction
Quadratic programming
Graph of a function
Abstract factory pattern
Malleability (cryptography)
Sharp-P-complete
Residue theorem