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.)
re(2): solution Comment 4 of 4 |
(In reply to re: solution by Ady TZIDON)

I see that now that you point it out. The equality holds for M = 2^n for only n= 0 or 1; no other values of n. For every other M, including 2^n for larger values of n, it is the inequality (greater than).
  Posted by Charlie on 2015-03-18 07:52:22

Please log in:
Remember me:
Sign up! | Forgot password

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

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