Search Results for ""

A problem in the theory of algebraic invariants that was solved by Hilbert using an existence proof.

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

The problem of deciding if two knots in three-space are equivalent such that one can be continuously deformed into another.

A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique

The problem of determining the vertices of a Schwarz-Christoffel mapping (Krantz 1999, p. 176).

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

A congruent number can be defined as an integer that is equal to the area of a rational right triangle (Koblitz 1993). Numbers (a,x,y,z,t) such that {x^2+ay^2=z^2; ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...