The Number of Intersection Points Made by the Diagonals of a Regular Polygon
Preprint
Abstract
We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by using Euler's formula $V-E+F=2$.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Rational products of sines of rational anglesAequationes mathematicae, 1993
- Multiple intersections of diagonals of regular polygons, and related topicsGeometriae Dedicata, 1980
- Adventitious quadrangles: a geometrical approachThe Mathematical Gazette, 1978
- Trigonometric diophantine equations (On vanishing sums of roots of unity)Acta Arithmetica, 1976
- Adventitious anglesThe Mathematical Gazette, 1975
- On linear relations between roots of unityMathematika, 1965
- On a problem of Steinhaus about polygonsMathematical Proceedings of the Cambridge Philosophical Society, 1961