Search Results for ""

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

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

The term "porism" is an archaic type of mathematical proposition whose historical purpose is not entirely known. It is used instead of "theorem" by some authors for a small ...

Define a power difference prime as a number of the form n^n-(n-1)^(n-1) that is prime. The first few power difference primes then have n=2, 3, 4, 7, 11, 17, 106, 120, 1907, ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...

Let alpha be a nonzero rational number alpha=+/-p_1^(alpha_1)p_2^(alpha_2)...p_L^(alpha_L), where p_1, ..., p_L are distinct primes, alpha_l in Z and alpha_l!=0. Then ...

A proof by contradiction establishes the truth of a given proposition by the supposition that it is false and the subsequent drawing of a conclusion that is contradictory to ...

If proofreader A finds a mistakes and proofreader B finds b mistakes, c of which were also found by A, how many mistakes were missed by both A and B? Assume there are a total ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...