Answer to Question #97979 in Combinatorics | Number Theory for Paul

Question

The sum of divisor function σ(n) returns the sum of all divisors d of the number n:
σ(n) = X
d|n
d
We denote Nk any number that fulfils the following condition:
σ(Nk) ≥ k · Nk
Find examples for N3, N4, N5 and prove that they fulfil this condition.

Answer 1

Dear Paul, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order