Search Results for ""
371 - 380 of 456 for Constructible polygonSearch Results
The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...
A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...
A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...
The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...
Let the absolute frequencies of occurrence of an event in a number of class intervals be denoted f_1, f_2, .... The cumulative frequency corresponding to the upper boundary ...
The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...
There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...
The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...
The insphere of a solid is a sphere that is tangent to all faces of the solid. An insphere does not always exist, but when it does, its radius r is called the inradius and ...
Find a closed plane curve of a given perimeter which encloses the greatest area. The solution is a circle. If the class of curves to be considered is limited to smooth ...
...
View search results from all Wolfram sites (6048 matches)

