Search Results for ""
1221 - 1230 of 2910 for Integer complexitySearch Results
A proper factor of a positive integer n is a factor of n other than 1 or n (Derbyshire 2004, p. 32). For example, 2 and 3 are positive proper factors of 6, but 1 and 6 are ...
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.
A quadratic polynomial is a polynomial of degree 2. A univariate quadratic polynomial has the form f(x)=a_2x^2+a_1x+a_0. An equation involving a quadratic polynomial is ...
A hypergeometric class of orthogonal polynomials defined by R_n(lambda(x);alpha,beta,gamma,delta) =_4F_3(-n,n+alpha+beta+1,-x,x+gamma+delta+1; alpha+1,beta+delta+1,gamma+1;1) ...
For a point y in Y, with f(y)=x, the ramification index of f at y is a positive integer e_y such that there is some open neighborhood U of y so that x has only one preimage ...
A real matrix is a matrix whose elements consist entirely of real numbers. The set of m×n real matrices is sometimes denoted R^(m×n) (Zwillinger 1995, p. 116).
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), ...
An extension to the Berlekamp-Massey algorithm which applies when the terms of the sequences are integers modulo some given modulus m.
The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...
A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...
...
View search results from all Wolfram sites (340627 matches)

