Poll
![]() | 4 votes (44.44%) | ||
No votes (0%) | |||
![]() | 5 votes (55.55%) | ||
No votes (0%) | |||
No votes (0%) | |||
![]() | 1 vote (11.11%) | ||
![]() | 1 vote (11.11%) | ||
![]() | 1 vote (11.11%) | ||
No votes (0%) | |||
![]() | 3 votes (33.33%) |
9 members have voted
March 2nd, 2019 at 1:53:38 AM
permalink
Yes - please let Barbara have my beer when you all meet up in Spring.Quote: WizardI have to give the beer to ... Barbara, if he wishes.
Can anyone find a web page that gives solutions for higher order regular n-gons?
I've only just stumbled across https://www.unige.ch/~gander/Preprints/BDM56-GanderE.pdf this morning - it looks very interesting and has the proof for square (s 5.1) and pentagon (s 5.2). Essentially he introduces Steiner Points and shows various lemmas (I haven't used that word since university!). As a hint, if you don't want to cheat, you need 3 junctions for a pentagon.
March 2nd, 2019 at 5:16:43 AM
permalink
Quote: sodawaterI don't understand how the soap KNOWS how to solve this problem.
Thanks for your comment! I was getting very sad over the lack of shared enthusiasm concerning the insanity of soap-based mathematics!
March 2nd, 2019 at 7:52:28 AM
permalink
Interesting stuff. Reminds me of the travelling salesman problem.
It's not whether you win or lose; it's whether or not you had a good bet.
March 2nd, 2019 at 8:28:10 PM
permalink
Quote: WizardYes, that is pretty much the case. Lest, you feel I'm being unfair, I think most here can vouch that I like to see winners show their work to get full credit. I know it is difficult conveying a full solution with a keyboard, so I don't need to see every step. Glorified trial and error is not the kind of "work" I like to see.
Hint: Calculus is the perfect tool for problems like this, and we all know much I love calculus.

If the House lost every hand, they wouldn't deal the game.