Problem 5
Find the greatest integer for which there are points in the plane with such that, for each , triangles and are congruent.
Step 4 of 6: Conclude the upper bound
Detailed analysis
At most half of the eight necessary candidates can survive the pairing argument, so n is at most 4.