MathDB
Fermat prime

Source: CWMI 2015 Q8

August 20, 2015
number theory

Problem Statement

Let kk be a positive integer, and n=(2k)!n=\left(2^k\right)! .Prove that σ(n)\sigma(n) has at least a prime divisor larger than 2k2^k, where σ(n)\sigma(n) is the sum of all positive divisors of nn.