With σ(n) we denote the sum of natural divisors of the natural number n. Prove that, if n is the product of different prime numbers of the form 2k−1 for k∈N(Mersenne′s prime numbers) , than σ(n)=2m, for some m∈N. Is the inverse statement true? algebrapolynomialfunctioninequalitiesnumber theoryprime numbersnumber theory unsolved