Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Prove that if $n$ is a perfect number, $kn$ is not.


If $\gcd(k,n)=1$ then this is clear.

(assume $\sigma(n)=2n$ , $\sigma(nk)=2kn$ , then $k=\sigma(k)$ but $\sigma(k)>k)$.

But what about $\gcd(k,n)>1$?

share|improve this question
add comment

2 Answers

Hint: Find some proper divisors of $kn$ that add up to exactly $kn$. Are any divisors missing?

share|improve this answer
    
sigma(kn)= kn + k +n+.. ? –  user1932595 Apr 4 '13 at 6:39
2  
@user1932595 Look at an example, like how $6 = 1 + 2 + 3$ is perfect and $12 = 2 + 4 + 6$ is not –  Cocopuffs Apr 4 '13 at 7:13
add comment

Let $a_1,...a_r$ be the divisors of $n$, we know that $\sum a_i = n$. So $kn$ is divisible by $ka_1,...,ka_n$ which sum to $kn$ but also by $a_1$ so the sum of the divisors of $kn$ is greater than $kn$.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.