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?
(In reply to
How Leonhard would solve it by JLo)
According to the problem statement, there are n points TOTAL. So V=n,
not n+3, and Charlie's guess is correct even if his method may not be.
|
|
Posted by Richard
on 2006-08-18 19:41:30 |
re: How Leonhard would solve it
