an interesting little problem I'm working on to bide some time.
Welcome to BrainDen.com - Brain Teasers Forum
|Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.
Of course, you can also enjoy our collection of amazing optical illusions and cool math games.
If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.
Thanks and enjoy the Den :-)
happy ending problem
Posted 04 July 2014 - 03:36 PM
It seems tantalizingly simple to throw down one fewer points and show the absence of the required n-gon.
But I guess that's not enough. It's harder to prove something doesn't exist in any case b/c you have to look at every case and there are too many. You'd have to classify them somehow and disprove each class.
Must be easier ways to get $1k, but it's interesting nonetheless.
Have you found ways to classify groups of points?
Vidi vici veni.
Posted 09 July 2014 - 07:08 AM
here's what I've been thinking.
using the good will hunting problem to classify groups of points.
I'm not quite sure how yet, been thinking about it though.
Posted 09 July 2014 - 08:55 AM
I'm not sure how either.
But it may lead to a divide and conquer kind of simplification, which seems to be needed.
I'd be interested to know what you come up with.
Vidi vici veni.
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users