Prove that $\ln n \geq k\ln 2$, where $n$ is a natural number and $k$ is the number of distinct primes that divide $n$.
Source:
Tags: logarithms, function
Prove that $\ln n \geq k\ln 2$, where $n$ is a natural number and $k$ is the number of distinct primes that divide $n$.