MathDB

inequality with least common multiple of n numbers

Source: Czech and Slovak Match 1999 P6

October 1, 2017

inequalitiesleast common multiplenumber theory

Problem Statement

Prove that for any integer

n \ge 3

, the least common multiple of the numbers

1,2, ... ,n

is greater than

2^{n-1}