TOPICS
Search

Search Results for ""


301 - 310 of 2089 for Eulers Polygon Division ProblemSearch Results
The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...
A sultan has granted a commoner a chance to marry one of his n daughters. The commoner will be presented with the daughters one at a time and, when each daughter is ...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at the origin. The exact solution is given by the sum N(r) = ...
Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...
A random polygon containing the origin (Kovalenko 1999).
The edge of a polygon or face of a polyhedron are sometimes called sides.
For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...
Except for convex polygons, every simple polygon has at least one mouth.
Except for triangles, every simple polygon has at least two nonoverlapping ears.
A dodecagon is a 12-sided polygon. Several special types of dodecagons are illustrated above. In particular, a dodecagon with vertices equally spaced around a circle and with ...
1 ... 28|29|30|31|32|33|34 ... 209 Previous Next

...