Search Results for ""

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...

Draw a circle that cuts three given circles perpendicularly. The solution is known as the radical circle of the given three circles. If it lies outside the three circles, ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

The problem of finding the curve down which a bead placed anywhere will fall to the bottom in the same amount of time. The solution is a cycloid, a fact first discovered and ...