News for hackers. Stuff that matters.
Re:New proof of a minimum property of the regular n-gon (1947) by theoh on Tuesday April 19, 2016 @01:48PM (#11528751)
It's a 2D problem: If you know the difference between circles circumscribed around vs circles inscribed in a polygon, that's probably all the geometry you need. The proof is a series of inequalities about the various areas inside the circumscribed circle and outside the polygon, and also the parts of the circumscribed circle that would be cut off by a tangent to the inscribed circle at the points where it touches the polygon.

Does that help a bit?

Re:New proof of a minimum property of the regular n-gon (1947) by ccvannorman on Tuesday April 19, 2016 @02:52PM (#11529230)
Yes, in addition to the [current] top comment, this helps a great deal. thanks!

HackerNews: Simulating AI-generated human readable proofs from real math proofs since 2011