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

Home > Just Math
An interesting equation (Posted on 2007-08-05) Difficulty: 3 of 5
If d(x) is the number of positive divisors of x, and n(x) is the number of distinct prime factors of x, show that d(A)=Σ(2^n(A/i²)) for all positive i such that A/i² is an integer.

  Submitted by Praneeth    
Rating: 3.6667 (3 votes)
Solution: (Hide)
Consider the equation x*y=A. No. of solutions of (x,y)=d(A).---(1)
If LCM(x,y)=L, GCD(x,y)=G, then x*y=A => L*G=A We know that L is a multiple of G, So G² is a factor of A.
For every G, L=A/G.----(2)
Now we have to find No. of solutions of L(x,y)=L and G(x,y)=G for each (L,G) pair.
No. of solutions will be 2^n(L/G) = 2^n(A/G²) (from(2))
Total no. of solutions = Σ2^(A/i²); where (A/i²) is an integer and i>0.
From (1), Σ2^(x/i²) = d(A).

No. of solutions for x,y whose LCM is L and GCD is G =2^n(L/G)
Proof:
Consider prime factorization of both L and G. Let exponent of a prime factor of L in L,G,x,y be i,j,k,l respectively.
we know that i>=j, i=max(k,l) and j=min(k,l)
If i>j, k can take either i or j. So, 2 possibilities.
If i=j, only one possibility for k as well as l.
In the same way find and multiply for every prime factor of L.
So, No. of solutions for (x,y) is simply equal to 2^n(L/G).
Other Solution is given in the comments by Eigenray.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolutionEigenray2007-08-06 09:09:20
Hints/TipsHintPraneeth2007-08-06 01:23:53
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 (5)
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