Problem #PRU-35753

Problems Discrete Mathematics Combinatorics Integer lattices Integer lattices (other) Methods Pigeonhole principle Pigeonhole principle (other)

Problem

A convex polygon on a plane contains no fewer than \(m^2+1\) points with whole number co-ordinates. Prove that within the polygon there are \(m+1\) points with whole number co-ordinates that lie on a single straight line.