This is really slick, but it was a bit of a puzzle for me trying to turn it into a paper proof! After a few minutes, I realized that you can do it by induction on the number of vertices: it's trivial for n = 3, and if it holds for n - 1, slice off a corner and see what happens.https://twitter.com/ThingsWork/status/1121857148068065280 …
-
Show this thread -
Replying to @St_Rev
Does cutting off a corner necessarily prove it for all n+1-gons? It strikes me there could exist n+1-gons that aren't a corner cut off an n-gon, maybe hole in the induction.
1 reply 0 retweets 1 like
Replying to @ded_ruckus
Oh, like a rectangle, yeah. You'd have to cut a 'triangle' with two right angles and a vertex at infinity. Good point. Well, the spider proof is easier anyway.
9:50 AM - 27 Apr 2019
0 replies
0 retweets
2 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
. Banned in Sweden. SubGenius, Zhuangist, white-hat troll. Defrocked mathematician. Brain problems.