No-Three-in-a-Line-Problem

DOWNLOAD Mathematica Notebook

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not just a horizontal or vertical line). The number of distinct solutions (not counting reflections and rotations) for n=1, 2, ..., are 1, 1, 4, 5, 11, 22, 57, 51, 156 ... (OEIS A000769). For large n, it is conjectured that it is only possible to select at most (c+epsilon)n lattice points with no three collinear, where

c=1/3pisqrt(3)
(1)
 approx 1.813799...
(2)

(OEIS A093602; Guy, pers. comm., Oct. 22, 2004), correcting Guy and Kelly (1968) and Guy (1994, p. 242) who found c=(2pi^2/3)^(1/3) approx 1.87.

52x52 No-three-in-a-line

The largest known solution is for n=52, found by Flammenkamp and illustrated above. Flammenkamp gives thousands of solutions for n<52.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.