Problem

Source: Czech and Slovak Match 1999 P6

Tags: inequalities, least common multiple, number theory



Prove that for any integer $n \ge 3$, the least common multiple of the numbers $1,2, ... ,n$ is greater than $2^{n-1}$.