For any two positive integers n>m prove the following inequality:
[m,n]+[m+1,n+1]≥m−n2nm
As always, [x,y] means the least common multiply of x,y.[I]Proposed by A. Golovanov inequalitiesnumber theorygreatest common divisoralgebraGCDleast common multiple