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

Home > Just Math
Prove the inequality (Posted on 2007-08-12) Difficulty: 2 of 5
Let A be a positive integer. Let D(A) be the number of solutions of xyz=A where x, y, and z are all positive integers; thus, D(6)=9. Let d(A) be the number of positive divisors of A, so d(6)=4.

Show that d(A)²-2D(A)+d(A)≥0. When does the equality hold?

See The Solution Submitted by Praneeth    
Rating: 4.2500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Other Simple Solution Comment 6 of 6 |
For any positive integer i,
d(i²)≥2d(i)-1
sum all the terms for every i which satisfies i|A
=> Σd(i²)≥2Σd(i) - Σ1
=> d(A)²≥2D(A)-d(A)
=> d(A)²-2D(A)+d(A)≥0
Hence proved.

No. of solutions of solutions of xyz=A is Σd(i) for every
i>0 which satisfies i|A.

Σd(i²) = π(Σ(2j+1)) 0 ≤ j ≤ (qk+1)
where qk: index of kth prime divisor of A.
Σd(i²) = π(qk+1)²= d(A)².

Edited on July 23, 2008, 8:02 am
  Posted by Praneeth on 2008-07-23 08:01:12

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


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information