Search Results for ""

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

There exist points A^', B^', and C^' on segments BC, CA, and AB of a triangle, respectively, such that A^'C+CB^'=B^'A+AC^'=C^'B+BA^' (1) and the lines AA^', BB^', CC^' ...

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

A Thue equation is a Diophantine equation of the form A_nx^n+A_(n-1)x^(n-1)y+A_(n-2)x^(n-2)y^2+...+A_0y^n=M in terms of an irreducible polynomial of degree n>=3 having ...

Macdonald's constant term conjectures are related to root systems of Lie algebras (Macdonald 1982, Andrews 1986). They can be regarded as generalizations of Dyson's ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...

A separable algebraic extension E of F for which every irreducible polynomial in F which has a single root in E has all its roots in E is said to be Galoisian. Galoisian ...

An algebraic extension K over a field F is a purely inseparable extension if the algebraic number minimal polynomial of any element has only one root, possibly with ...