Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.puzzles.independent

Topic: Can You Solve This $500 Puzzle?
Replies: 1   Last Post: Aug 12, 2012 8:14 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Avni Pllana

Posts: 503
Registered: 12/6/04
Re: Can You Solve This $500 Puzzle?
Posted: Aug 12, 2012 8:14 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> YWorld, the collaborative network for professionals,
> loves Math. To debut one of our selective groups, the
> Puzzle Breaker Club, we're posting a deceptively
> simple puzzle for the world to solve. If you think
> you have what it takes to crack this geometric
> puzzle, try your skills at:
> http://www.YWorld.com/puzzle


I think the number of maximal sets of non-intersecting diagonals for 11-gon is 29, or F(11) = 29 .

By inspection we obtain following data: F(5) = 1, F(6) = 3, F(7) = 4, F(8) = 7. According to these data we have to do with a Fibonacci-like sequence, F(n) = F(n-1) + F(n-2). So, if we extrapolate the obtained data we can write:

F(9) = 11,
F(10)= 18,
F(11)= 29.

Best regards,
Avni



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.