SOLUTION: Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime divisors of n).

Algebra ->  Logarithm Solvers, Trainers and Word Problems -> SOLUTION: Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime divisors of n).      Log On


   

Question 550585: Prove that, log(n) >= k.log(2) (Where n >= 2 and "k" denote the number of distinct prime divisors of n).
Answer by richard1234(7193) About Me  (Show Source):
You can put this solution on YOUR website!
We have



This is true because if we let , then we have

, and since each prime is greater than or equal to 2, this inequality holds.