Search Results for ""

A primary ideal is an ideal I such that if ab in I, then either a in I or b^m in I for some m>0. Prime ideals are always primary. A primary decomposition expresses any ideal ...

An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

If f(x) is a nonconstant integer polynomial and c is an integer such that f(c) is divisible by the prime p, that p is called a prime divisor of the polynomial f(x) (Nagell ...

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.

A ring for which the product of any pair of ideals is zero only if one of the two ideals is zero. All simple rings are prime.

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

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

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