Skip to content

Instantly share code, notes, and snippets.

@mrflip
Last active January 12, 2026 08:07
Show Gist options
  • Select an option

  • Save mrflip/a973b1c60f4a38fc3277ddd57ce65b28 to your computer and use it in GitHub Desktop.

Select an option

Save mrflip/a973b1c60f4a38fc3277ddd57ce65b28 to your computer and use it in GitHub Desktop.
Ancient Greek Geometry walkthrough / answers / cheats

Solutions for Ancient Greek Geometry (https://sciencevsmagic.net/geo)

Most solutions taken from the about thread. See the comments below for more additions since my last check-in.

Polygons

Circle Packs

Circumscribed Polygons

Non-Constructible Figures

Abuse of floating-point math can make the widget approve non-constructible polygons (polygons with edge count 7, 9, 11, 13, 14, 18, 19, 21, 22, 23, 25, 26, 27, 28, 29, 31, 33, 35, ..., which cannot be precisely constructed using straightedge and compass):

@ILoveMath62
Copy link

Octagon in 12 moves

@elijahdarcydominguez-afk

@ILoveMath62
Copy link

@ILoveMath62
Copy link

Regular polygons whose edge count is a Pierpont prime are constructible with angle trisection, but the current known angle trisector doesn’t do it perfectly. “You had one job angle trisector. One job.” Let’s say that it does perfectly. Could all regular polygons whose edge count are 1 above a multiple of 3 be constructible with angle trisection? Please figure this out. If it’s true, then a regular hendecagon is constructible with angle trisection, because the icosidigon would be, which is great. If it’s false, try doing it yourself. If it still turns out as false, that’s great too, because we want extremely small errors to the polygons we construct. Floating point causes the widget to be tricked into thinking the polygons are regular.

@Eddy119
Copy link

Eddy119 commented Jan 11, 2026

  1. Exact Angle trisection is impossible with just a compass and unmarked straightedge
  2. It's not as simple as 3n+1, this takes some effort to explain, but check the Wikipedia article on Pierpont primes for now
  3. 11-gon is a prime number but isn't a Pierpont prime so it isn't trisector constructible (but it apparently is neusis constructible, which I'm still intrigued about)
    Anyway for approximations without a trisector/neusis I'm not sure if Pierpont/trisector constructible polygons make it simpler to approximate... Anyway that tangent trick seems to work for all polygons

@Furlii
Copy link

Furlii commented Jan 12, 2026

@Furlii
Copy link

Furlii commented Jan 12, 2026

this app doesn't let me take arbitrary points on the plane

@Furlii
Copy link

Furlii commented Jan 12, 2026

if we construct a composite sided polygon, say 15, and let V0, V1, ... ,V13, V14 be the vertices ordered counterclockwise, then there are 8 vertices of our interest, not 14
V1, V2, V4, V7, V8, V11, V13, V14

if prime p-sided polygon, then there are simply p-1 vertices of our interest, example 7 :
V1, V2, V3, V4, V5, V6
the other vertices V0 (which is constructible) is a matter of choice, ideally it is point (1,0) but it can be anywhere

ref
https://en.wikipedia.org/wiki/Euler%27s_totient_function
https://en.wikipedia.org/wiki/Cyclotomic_polynomial

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment