Search Results for ""

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

The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...

A polytope in n-dimensional Euclidean space R^n whose vertices are integer lattice points but which does not contain any other lattice points in its interior or on its ...

A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.

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 D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that the interval [0,n] is contained in D, one can show ...

Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that n is in D, one can show that n+1 is also in D. ...

An extension A subset B of a group, ring, module, field, etc., such that A!=B.

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