MathDB

6

Part of 1999 Czech and Slovak Match

Problems(1)

inequality with least common multiple of n numbers

Source: Czech and Slovak Match 1999 P6

10/1/2017
Prove that for any integer n≥3n \ge 3, the least common multiple of the numbers 1,2,...,n1,2, ... ,n is greater than 2n−12^{n-1}.
inequalitiesleast common multiplenumber theory