Search Results for ""

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

The Gauss-Seidel method (called Seidel's method by Jeffreys and Jeffreys 1988, p. 305) is a technique for solving the n equations of the linear system of equations Ax=b one ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...

The decimal expansion of the Glaisher-Kinkelin constant is given by A=1.28242712... (OEIS A074962). A was computed to 5×10^5 decimal digits by E. Weisstein (Dec. 3, 2015). ...

The gnomon was an L-shaped movable sundial used for astronomical studies. It operated by resting on one leg so that the other pointed vertically upward. By measuring the ...

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...