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

A number h which satisfies the conditions of the congruum problem: x^2+h=a^2 and x^2-h=b^2, where x,h,a,b are integers. The list of congrua is given by 24, 96, 120, 240, 336, ...

As used in physics, the term "exact" generally refers to a solution that captures the entire physics and mathematics of a problem as opposed to one that is approximate, ...

In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...

The discontinuous solution of the surface of revolution area minimization problem for surfaces connecting two circles. When the circles are sufficiently far apart, the usual ...

The branch of algebraic topology which deals with homotopy groups. Homotopy methods can be used to solve systems of polynomials by embedding the polynomials in a family of ...

Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...

Given the "peaks" of three equilateral triangles placed on the sides of a triangle T, construct T. The problem was proposed by Lemoine (1868) and solved for the general case ...

A convex figure constructed by iteratively halving the base of an equilateral triangle and then sliding adjacent triangles so that they slightly overlap. Combining several ...

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...