Search Results for ""
191 - 200 of 422 for PolygonsSearch Results
A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...
If isosceles triangles with apex angles 2kpi/n are erected on the sides of an arbitrary n-gon A_0, and if this process is repeated with the n-gon A_1 formed by the free ...
One of the two 7-sided star polygons {7/2} and {7/3}, illustrated above.
Let h be the number of sides of certain skew polygons (Coxeter 1973, p. 15). Then h=(2(p+q+2))/(10-p-q).
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...
The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...
A bicentric quadrilateral, also called a cyclic-inscriptable quadrilateral, is a four-sided bicentric polygon. The inradius r, circumradius R, and offset x are connected by ...
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
Given a triangle with polygon vertices A, B, and C and points along the sides D, E, and F, a necessary and sufficient condition for the cevians AD, BE, and CF to be ...
...
View search results from all Wolfram sites (2560 matches)

