The Sylvester–Gallai Theorem

·Hacker News··

Every finite set of points in the Euclidean plane that is not collinear has a line that passes through exactly two of the points. This proof is by Michigan State University mathematician Leroy Milton Kelly. Consider a set S of points that aren’t all collinear, and define a connecting line to be a line that contains at least two of these points. There must be some point P and connecting line ℓ that are closer together than any other point-line pair in the set. Kelly now proves that &#

Read full article →

Related Articles

Unauthenticated remote code execution in Nginx
speedping · Hacker News · 6h ago
Highly classified US national security communications network goes down
monkeydust · Hacker News · 1d ago
Harvard researchers find AI coding agents shifted the bottleneck to code review
judahmeek · Hacker News · 1d ago
New Evidence Shows School Phone Bans Are Gradually Improving Test Scores
donohoe · Hacker News · 1d ago
Java4Shell: RCE in OpenJDK when processing Base64
werrett · Hacker News · 1d ago