Search Results for ""

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

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

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...