MathDB
n distinct triangles from 3n points

Source: IMAC Arhimede 2010 p1

May 5, 2019
combinatoricscombinatorial geometrypointscollinear

Problem Statement

3n3n points are given (n≥1n\ge 1) in the plane, each 33 of them are not collinear. Prove that there are nn distinct triangles with the vertices those points.
Back to ProblemsView on AoPS