Search Results for ""
511 - 520 of 1529 for Exploration problemSearch Results
A lottery in which three numbers are picked at random from the integers 1-14.
(x^2+axy+by^2)(t^2+atu+bu^2)=r^2+ars+bs^2, (1) where r = xt-byu (2) s = yt+xu+ayu. (3)
Half a zip-pair.
3 is the only integer which is the sum of the preceding positive integers (1+2=3) and the only number which is the sum of the factorials of the preceding positive integers ...
A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...
The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...
Consider the excircles J_A, J_B, and J_C of a triangle, and the external Apollonius circle Gamma tangent externally to all three. Denote the contact point of Gamma and J_A by ...
An identity in calculus of variations discovered in 1868 by Beltrami. The Euler-Lagrange differential equation is (partialf)/(partialy)-d/(dx)((partialf)/(partialy_x))=0. (1) ...
A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...
A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...
...
View search results from all Wolfram sites (160932 matches)

