Search Results for ""

An Abelian planar difference set of order n exists only for n a prime power. Gordon (1994) has verified it to be true for n<2000000.

The prime subfield of a field F is the subfield of F generated by the multiplicative identity 1_F of F. It is isomorphic to either Q (if the field characteristic is 0), or ...

1 and -1 are the only integers which divide every integer. They are therefore called the prime units.

The set of prime numbers, sometimes denoted P (Derbyshire 2004, p. 163), and implemented in the Wolfram Language as Primes. In the Wolfram Language, a quantity can be tested ...

Given algebraic numbers a_1, ..., a_n it is always possible to find a single algebraic number b such that each of a_1, ..., a_n can be expressed as a polynomial in b with ...

A primitive group action is transitive and it has no nontrivial group blocks. A transitive group action that is not primitive is called imprimitive. A group that has a ...

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