Will the inequality log M ≥ C*log 2 always hold, where M is a positive integer and C is the number of distinct prime numbers that divide M?
If so, prove it.
If not, give an example.

(In reply to solution by Charlie)

The equality holds for M=1 as well.

Posted by Ady TZIDON on 2015-03-17 11:35:21