Suppose there is a number A.
Let its divisors are : A(itself) , 1, x, y, z,.....
Let B be a number such that B = 1 + x + y + z +.... (Not adding A)
Let the divisors of B are : B, 1, p, q, r,....
and A = 1 + p + q + r + s + ..... (Not adding B)
Find a minimum Number pair ( A, B) satisfying above condition.
[B][COLOR="Blue"]Anyone who thinks he knows all the answers, must not be up-to-date on the questions[/COLOR][/B]
[B]Anshul[/B]:)
Is it (1,1)
------
Neelima
Actually i forgot to mention that you dont have to consider the number itself as its divisor in this case.
So case (1,1) is not correct.
[B][COLOR="Blue"]Anyone who thinks he knows all the answers, must not be up-to-date on the questions[/COLOR][/B]
[B]Anshul[/B]:)
Is it (6,6) ?
all perfect numbers satisfy this condition....
6 is the samllest perfect number.
Posting Permissions
Reply With Quote