All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Shapes > Geometry
Points on a plane (Posted on 2006-08-18) Difficulty: 3 of 5
3 points are drawn on a plane, and inside their triangular region, more points are added such that no 3 are collinear, such that there are n points in total. What is the maximum possible number of line segments one could draw connecting two of these points such that none intersect other than at their endpoints?

No Solution Yet Submitted by atheron    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(2): How Leonhard would solve itRobby Goetschalckx2006-08-21 07:01:06
re: How Leonhard would solve itCharlie2006-08-19 00:03:53
re: How Leonhard would solve itRichard2006-08-18 19:41:30
SolutionHow Leonhard would solve itJLo2006-08-18 19:24:38
A guessCharlie2006-08-18 16:15:32
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information