I know that the sum of divisors of an integer n can exceed it (abundant numbers) but can this occur when only considering odd divisors of n? Can the sum of all integers j : j|n, 2∤j be greater than n? If not how is it proven, and if so what is an example?
Asked
Active
Viewed 51 times
1
-
3Wikipedia has the answer. – Greg Martin Dec 30 '23 at 05:36
-
Hint: Try to consider Odd numbers. Maybe proper divisors? – Adam Wrzesiński Dec 30 '23 at 05:37
-
Since the sum of reciprocals of odd numbers diverge to infinity, the answer is yes. – Calvin Lin Dec 30 '23 at 07:09