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?

  Submitted by Praneeth    
Rating: 4.2500 (4 votes)
Solution: (Hide)
Consider a number x which is a divisor of A. Let P(x,A) be no. of positive divisors of A not greater than x. All divisors of x are less than or equal to x and also factors of A. So, P(x,A)>=d(x).--(1)
D(A)=Σ{No. of solutions of xy=i}; where i takes all possible values of factors of A.
D(A)=Σd(i) <= ΣP(i,A) (from (1))
P(i,A) varies from 1 to d(A) when i varies from 1 to A.
D(A) <= 1+2+3+....+d(A) <= (1/2)*d(A)*(d(A)+1).
Hence, d(A)²-2D(A)+d(A)≥0.
The equality holds when d(i)=P(i,A); for every i which is a divisor of A.--(2)
Let p2>p1 are two distinct prime divisors of A, then P(p2,A)>=d(p2)+1(This is because p1 is a prime divisor of A less than p2 and by definition of P(x,A)).
So, there can't be two or more distinct prime factors for A for the equality to hold.(from eq(2))
If n(A): no. of distinct prime divisors of A, then equality holds for A whose n(A)= 0 or 1.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionOther Simple SolutionPraneeth2008-07-23 08:01:12
SolutionFuller solutionFrankM2008-02-20 22:21:52
re: solution with proof (quick fix)Praneeth2007-08-14 02:51:47
re(2): solution with proof (quick fix)Daniel2007-08-14 02:07:53
re: solution with proofPraneeth2007-08-13 03:25:56
solution with proofDaniel2007-08-13 01:57:05
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
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