MathCastle
Number TheoryChallengeArithmetic Functions

Arithmetic Functions · Challenge problem

A number is abundant if σ(n)>2n\sigma(n) > 2n. What is the smallest odd abundant number?