For any grid, x by x, figure out a formula for the greatest number of points that can be put on the inside of the grid such that no three points are colinear.
(In reply to
re(3): So at least the first 32 are reachable... by McWorter)
Oops! Error in the statement of my problem. But first I apologize to Corey for changing the subject. I'll shut up after I correct the error.
T should be the set {au+bv  a and b are nonegative integers with a+b<n, u=(1,0), v=(.5,sqr(3)/2)}.

Posted by McWorter
on 20050520 21:25:33 