Moser's Circle Problem with a Regular n-gon
A regular $n$-gon is inscribed in a circle. A chord connects every point to every other point. The 'regular' n-gon permits high degree intersections.
How many chords are drawn for $n$ points? $\binom{n}{2}=$
How many intersections including perimeter points? =
Regions, (A007678) =
+ (
arc Regions) =
n:
Clear Output
Show Intersections
listsSegs
makeEdges
TraceFace
face Pointer
Verification
list All Vertices
list Edges
by Vertex
HighDegree
Vertices
listAngles
Face Area
Face ID
by Vertex
See Neighbors
On Console
toggle
labels
toggle
points
toggle
color
toggle
lines
Special
OUTPUT: