MathDB
E 25

Source:

January 20, 2013
logarithmsfunction

Problem Statement

Prove that ln⁡n≥kln⁡2\ln n \geq k\ln 2, where nn is a natural number and kk is the number of distinct primes that divide nn.
Back to ProblemsView on AoPS