MathDB
(2007 KMO #8) Product of primes less than n

Source:

August 27, 2010
inductioninequalitiesnumber theoryprime numbersrelatively primenumber theory proposed

Problem Statement

For all positive integer n2 n\geq 2, prove that product of all prime numbers less or equal than n n is smaller than 4n 4^{n}.