Sign in to follow this  
Followers 0

happy ending problem

4 posts in this topic

Posted · Report post

an interesting little problem I'm working on to bide some time.

0

Share this post


Link to post
Share on other sites

Posted · Report post

I'd work on it, but if you solve it does that mean you have to marry someone?

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?

0

Share this post


Link to post
Share on other sites

Posted · Report post

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.

0

Share this post


Link to post
Share on other sites

Posted · Report post

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.

0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0

  • Recently Browsing   0 members

    No registered users viewing this page.