GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Euler's Polygon Division Problem -- from Wolfram MathWorld

Search

Euler's Polygon Division Problem


The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in 1751, and the solution is the Catalan number E_n=C_(n-2).


See also

Catalan Number, Catalan's Problem, Polygon Diagonal, Regular Polygon Division by Diagonals

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • division problems
  • (1+i)^(1/5)
  • divisors 3600

References

Forder, H. G. "Some Problems in Combinatorics." Math. Gaz. 41, 199-201, 1961.Guy, R. K. "Dissecting a Polygon Into Triangles." Bull. Malayan Math. Soc. 5, 57-60, 1958.

Referenced on Wolfram|Alpha

Euler's Polygon Division Problem

Cite this as:

Weisstein, Eric W. "Euler's Polygon Division Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EulersPolygonDivisionProblem.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.