Search Results for ""
291 - 300 of 456 for Constructible polygonSearch Results
An extension of two-valued logic such that statements need not be true or false, but may have a degree of truth between 0 and 1. Such a system can be extremely useful in ...
An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...
Given a circle C with center O and radius k, then two points P and Q are inverse with respect to C if OP·OQ=k^2. If P describes a curve C_1, then Q describes a curve C_2 ...
Given a knot diagram, it is possible to construct a collection of variables and equations, and given such a collection, a group naturally arises that is known as the group of ...
The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...
In the fields of functional and harmonic analysis, the Littlewood-Paley decomposition is a particular way of decomposing the phase plane which takes a single function and ...
A geometric construction done with a movable compass alone. All constructions possible with a compass and straightedge are possible with a movable compass alone, as was ...
The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...
Consider a convex pentagon and extend the sides to a pentagram. Externally to the pentagon, there are five triangles. Construct the five circumcircles. Each pair of adjacent ...
Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...
...
View search results from all Wolfram sites (6048 matches)

