Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-13T09:50:27.694Z Has data issue: false hasContentIssue false
  • English
  • Français

Some Problems in Combinatorics

Published online by Cambridge University Press:  03 November 2016

H. G. Forder
H. G. Forder*
Affiliation:
University of Auckland
Get access Rights & Permissions [Opens in a new window]

Extract

The following problems are merely different forms of one

1. In how many ways can a convex polygon of n + 1 sides be split into triangles by non-intersecting diagonals? We represent such a splitting by a symbol. Take one side of the polygon as base and letter the other n sides in order by a, b, c,…. If a triangle with sides lettered x, y is cut off, denote the diagonal by (xy). If this diagonal and side z form the sides of another triangle of the dissection, denote the third side of that triangle by ((xy)z). Similarly for two diagonals, as the figure illustrates. Finally the symbol for the unlettered base is the symbol for the dissection.

Type
Research Article
Information
The Mathematical Gazette , Volume 45 , Issue 353 , October 1961 , pp. 199 - 201
Copyright
Copyright © Mathematical Association 1961

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)