A computing scientist’s approach to a once-deep theorem of Sylvester’s
Well, actually it wasn’t Sylvester’s theorem, it was only his conjecture — dating from the year 1893 -, and it remained so for more than 40 years until T. Gallai (alias Grünwald) “finally succeeded, using a rather complicated argument” [Coxeter]. We shall derive (essentially) the simple argument of L.M. Kelly (1948).
KeywordsVariant Function Euclidean Plane Simple Argument Chess Play Proof Sketch
- Coxeter, FRS, H.S.M. “Introduction to Geometry”, 2nd ed., John Wiley & Sons, Inc. New York etc., pp 65–66Google Scholar