Search Results for ""
171 - 180 of 1780 for Prime FactorSearch Results
p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...
The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...
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), ...
d_n=p_(n+1)-p_n. (1) The first few values are 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, ... (OEIS A001223). Rankin has shown that d_n>(clnnlnlnnlnlnlnlnn)/((lnlnlnn)^2) ...
An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...
A distribution with probability function P(x)=(x^(alpha-1)(1+x)^(-alpha-beta))/(B(alpha,beta)), where B is a beta function. The mode of a variate distributed as ...
A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...
For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.
A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...
A quantity which transforms like a tensor except for a scalar factor of a Jacobian.
...
View search results from all Wolfram sites (10835 matches)

