Problem

Source:

Tags: algebra, polynomial, function, inequalities, number theory, prime numbers, number theory unsolved



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 2k1 for kN(Mersennes prime numbers) , than σ(n)=2m, for some mN. Is the inverse statement true?