Search Results for ""

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

When ac is divisible by a number b that is relatively prime to a, then c must be divisible by b.

The problem of finding all independent irreducible algebraic relations among any finite set of quantics.

The division of two complex numbers can be accomplished by multiplying the numerator and denominator by the complex conjugate of the denominator, for example, with z_1=a+bi ...

A long division in which most or all of the digits are replaced by a symbol (usually asterisks) to form a cryptarithmetic.

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

Compass and straightedge geometric constructions dating back to Euclid were capable of inscribing regular polygons of 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...