Search Results for ""

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

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

The directions in which the principal curvatures occur.

An ideal I of a ring R is called principal if there is an element a of R such that I=aR={ar:r in R}. In other words, the ideal is generated by the element a. For example, the ...

If a function f has a pole at z_0, then the negative power part sum_(j=-k)^(-1)a_j(z-z_0)^j (1) of the Laurent series of f about z_0 sum_(j=-k)^inftya_j(z-z_0)^j (2) is ...