[math-fun] Re: Avoiding Colinear Points
The latest results from Flammenkamp appear at http://wwwhomes.uni-bielefeld.de/achim/no3in/readme.html Someone should add this link to A000769. Correction: According to a table there, at least one solution is known for all n <= 46 and n=48,50,52. Tony
The definition of A769 says " No-3-in-line problem: ways of placing 2n points on n X n grid so no 3 are in a line." Does that include just the regular diagonals, or does it count (1,1), (2,3), (3,5) as being in a line? It could be either. (My earlier comment about using n-queens solutions assumed only 45-degree diagonals.
No three in any line. R. On Sat, 23 Oct 2004, Jud McCranie wrote:
The definition of A769 says " No-3-in-line problem: ways of placing 2n points on n X n grid so no 3 are in a line." Does that include just the regular diagonals, or does it count (1,1), (2,3), (3,5) as being in a line? It could be either. (My earlier comment about using n-queens solutions assumed only 45-degree diagonals.
If n points are at least a unit apart, and are not coplanar nor colinear, what is the smallest volume required to contain them? Jon Perry perry@globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com
participants (5)
-
Jon Perry -
Jud McCranie -
Michael Kleber -
Richard Guy -
T. D. Noe