TOPICS
Search

Search Results for ""


331 - 340 of 1570 for Napoleon's problemSearch Results
Isolated resonances in a dynamical system can cause considerable distortion of preserved tori in their neighborhood, but they do not introduce any chaos into a system. ...
The maximal number of regions into which space can be divided by n planes is f(n)=1/6(n^3+5n+6) (Yaglom and Yaglom 1987, pp. 102-106). For n=1, 2, ..., these give the values ...
Let h:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) be efficiently computable by an algorithm (solving a P-problem). For fixed y in {0,1}^(l(n)), view h(x,y) as a function h_y(x) of x ...
The Frobenius number is the largest value b for which the Frobenius equation a_1x_1+a_2x_2+...+a_nx_n=b, (1) has no solution, where the a_i are positive integers, b is an ...
Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...
n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...
The lines connecting the vertices and corresponding circle-circle intersections in Malfatti's problem coincide in a point X_(179) called the first Ajima-Malfatti point ...
An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...
A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...
The metric properties discovered for a primitive figure remain applicable, without modifications other than changes of signs, to all correlative figures which can be ...
1 ... 31|32|33|34|35|36|37 ... 157 Previous Next

...