Search Results for ""

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

An algorithm for computing an Egyptian fraction.

An algorithm for computing an Egyptian fraction (Stewart 1992).

Taylor's theorem states that any function satisfying certain conditions may be represented by a Taylor series, Taylor's theorem (without the remainder term) was devised by ...

A generalization of Fermat's little theorem. Euler published a proof of the following more general theorem in 1736. Let phi(n) denote the totient function. Then a^(phi(n))=1 ...

Bürmann's theorem deals with the expansion of functions in powers of another function. Let phi(z) be a function of z which is analytic in a closed region S, of which a is an ...

The converse of Fisher's theorem.

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

There are several theorems that generally are known by the generic name "Pappus's Theorem." They include Pappus's centroid theorem, the Pappus chain, Pappus's harmonic ...

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...