Search Results for ""

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

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...

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 group that has a primitive group action.

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 primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...

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

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...