All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Log Inequality Illation (Posted on 2015-03-17) Difficulty: 2 of 5
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.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution solution | Comment 2 of 4 |
As C is positive and the log function is monotonically increasing, the inequation is equivalent to 

M >= 2^C

which is true as each distinct prime divisor on the left is replaced by a 2, the smallest possible prime divisor, on the right. Not only is 2 less than or equal to every possible prime divisor on the left, but the "distinct" qualifier means there are usually more prime divisors on the left than on the right. In fact the only time the equality possibility holds is for M = 2.

Illustrative example:

3*5*7*7 >= 2*2*2

  Posted by Charlie on 2015-03-17 09:56:07
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (10)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information