TOPICS
Search

Search Results for ""


2931 - 2940 of 13135 for Highly Composite NumberSearch Results
The addition of two quantities, i.e., a plus b. The operation is denoted a+b, and the symbol + is called the plus sign. Floating-point addition is sometimes denoted direct ...
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.
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.
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.
1 ... 291|292|293|294|295|296|297 ... 1314 Previous Next

...