We say that a positive integer \( n \) is *abundant* if \( S(n) > 2n \) , where \( S(n) \) represents the sum of divisors of \( n \).

Determine the smallest positive integer \( m \) with the following property: for every positive integer \( k > m \), the number \( 2k \) is equal to the sum of two abundant numbers.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

There are no comments in this discussion.