Recently I came through a book of Arthur Engel which mentioned a problem called Sylvester Problem which states that-
A finite set $S$ of $n$ points in the Euclidean Plane has the property that any line through two of them passes through a third. Show that all the points lie on a line.
In Engel's book, the problem has been solved using the so called Extremal Principle (for details of the proof see Problem Solving Strategies by Arthur Engel).
But I think that the problem is trivial. My solution is as follows.
Let $A_i$ denote the points in the plane $1 \leq i \leq n$. Now choose any three points, say $A_1$ , $A_ 2$ and $A_3$. By hypothesis there is a straight line through these three points, let it be $L_1$ . Now choose the points $A_2$ , $A_3$ and $A_4$. Again a straight line passes through the three points. Call this line $L_2$. Now since two lines cannot intersect in more than one point, $L_1$ and $L_2$ must coincide. Now applying induction the result is proved.
The result is still valid in planes other than Euclidean Planes in which two straight lines cannot intersect in more than one point.
Now my question is if the theorem is that much trivial (if my proof is correct), why even bother about calling it as a significant theorem?