TOPICS
Search

Search Results for ""


2981 - 2990 of 4217 for Strong Lawof Small NumbersSearch Results
e is transcendental.
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 ...
It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...
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 amicable quadruple as a quadruple (a,b,c,d) such that sigma(a)=sigma(b)=sigma(c)=sigma(d)=a+b+c+d, (1) where sigma(n) is the divisor function. If (a,b) and (x,y) are ...
A factorization of the form 2^(4n+2)+1=(2^(2n+1)-2^(n+1)+1)(2^(2n+1)+2^(n+1)+1). (1) The factorization for n=14 was discovered by Aurifeuille, and the general form was ...
An odd prime p is called a cluster prime if every even positive integer less than p-2 can be written as a difference of two primes q-q^', where q,q^'<=p. The first 23 odd ...
The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...
1 ... 296|297|298|299|300|301|302 ... 422 Previous Next

...