# Concurrent Diagonals in a 30-Gon

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

When three lines meet at a point, they are concurrent. For the diagonals of a 30-gon, out of the 16801 intersection points, there are 3001 points where three or more lines intersect, with 193 different ways to select three concurrent diagonals.

[more]
Contributed by: Ed Pegg Jr (November 2015)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

In the initialization, {1,3,9,4,8,5,14} is a sample dataset (selected triple 102). The first six numbers are a partition of 30; the last number is the sector of the 30-gon where the intersection occurs.

References

[1] B. Poonen and M. Rubinstein, "The Number of Intersection Points Made by the Diagonals of a Regular Polygon," arxiv.org/abs/math/9508209.

[2] Wikipedia. "Pizza Theorem." (Nov 13, 2015) en.wikipedia.org/wiki/Pizza_theorem.

## Permanent Citation

"Concurrent Diagonals in a 30-Gon"

http://demonstrations.wolfram.com/ConcurrentDiagonalsInA30Gon/

Wolfram Demonstrations Project

Published: November 23 2015