Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-24T13:37:00.359Z Has data issue: false hasContentIssue false

Some Theorems on Convex Polygons

Published online by Cambridge University Press:  20 November 2018

E. Altman*
Affiliation:
Technion-Israel Institute of Technology, Haifa, Israel
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper diagonals of various orders in a (strict) convex polygon Pn are considered. The sums of lengths of diagonals of the same order are studied. A relationship between the number of consecutive diagonals which do not intersect a given maximal diagonal and lie on one side of it and the order of the smallest diagonal among them is established. Finally a new proof of a conjecture of P. Erdos, considered already in [1], is given.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1972

References

1. Altman, F., On a Problem by P. Erdos, Amer. Math. Monthly, 70 (1963), 148-157.Google Scholar