Let $x\geq 29, x \in \mathbb{N}$. Then the product of all primes that are less or equal to $x$ is greater than $2^x$

113 Views Asked by At

I am interested in ways to prove that claim, I came across it when reading about the analysis of the average case complexity of Rabin-Karp's algorithm for string matching.