TOPICS
Search

Search Results for ""


3091 - 3100 of 4217 for Strong Lawof Small NumbersSearch Results
Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.
An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...
1 and -1 are the only integers which divide every integer. They are therefore called the prime units.
The set of prime numbers, sometimes denoted P (Derbyshire 2004, p. 163), and implemented in the Wolfram Language as Primes. In the Wolfram Language, a quantity can be tested ...
For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.
The doublestruck capital letter Q, Q, denotes the field of rationals. It derives from the German word Quotient, which can be translated as "ratio." The symbol Q first ...
A statistical distribution in which the variates occur with probabilities asymptotically matching their "true" underlying statistical distribution is said to be random.
A pair of consecutive primes whose digits are rearrangements of each other, first considered by A. Edwards in Aug. 2001. The first few are (1913, 1931), (18379, 18397), ...
There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...
A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...
1 ... 307|308|309|310|311|312|313 ... 422 Previous Next

...