Search Results for ""

Let p be an odd prime, k be an integer such that pk and 1<=k<=2(p+1), and N=2kp+1. Then the following are equivalent 1. N is prime. 2. There exists an a such that ...

f(z)=k/((cz+d)^r)f((az+b)/(cz+d)) where I[z]>0.

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A quantity x>0, which may be written with an explicit plus sign for emphasis, +x.

A sequence {mu_n}_(n=0)^infty is positive definite if the moment of every nonnegative polynomial which is not identically zero is greater than zero (Widder 1941, p. 132). ...

Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...

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 ...

A proper fraction is a fraction p/q with p,q>0 such that p/q<1. A fraction p/q>1 is called an improper fraction.