Search Results for ""

A premise is a statement that is assumed to be true. Formal logic uses a set of premises and syllogisms to arrive at a conclusion.

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

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

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

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

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 directions in which the principal curvatures occur.

At each point on a given a two-dimensional surface, there are two "principal" radii of curvature. The larger is denoted R_1, and the smaller R_2. The "principal directions" ...

A data structure designed to allow repeated extraction of the smallest remaining key (Skiena 1990, p. 38).