
For a positive integer n, let p(n) be the number of prime factors of n. Show that ln n ≥ p(n) ln 2.
Solution
n ≥ the product of its prime factors. Each prime factor ≥ 2, so n ≥ 2p(n). Taking logs gives the result.
![]()
© John Scholes
jscholes@kalva.demon.co.uk
29 Oct 2003
Last corrected/updated 29 Oct 03