[FONT=Times New Roman]I need to prove that for all positive integers n, N^2 is >=2
Last edited by miz.perfect84; August 11th 2009 at 11:21 AM.
Follow Math Help Forum on Facebook and Google+
Originally Posted by miz.perfect84 I need to prove that for all positive integers n, σ (2n) > 2σ (n), where σ (n) denotes the sum of the divisors of n. [Hint: put , where r > = 0 and m is odd, and consider the cases r = 0 and r >0.] Use the fact that if then If is odd, then Otherwise, where and is odd, so
that made it perfectly clear, thank you
View Tag Cloud