Search Results for ""
2791 - 2800 of 4021 for Weak Lawof Large NumbersSearch Results
A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...
A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...
e is transcendental.
Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...
A quantity which is either 0 (zero) or positive, i.e., >=0.
Euclidean n-space is denoted R^n.
In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...
Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...
An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...
An asymptotic series is a series expansion of a function in a variable x which may converge or diverge (Erdélyi 1987, p. 1), but whose partial sums can be made an arbitrarily ...
...
View search results from all Wolfram sites (41821 matches)

