Some Mathematics in O()-notation

Proof: Assume that there are only prime numbers. Then the number of all ways to multiply of them (perhaps with repetitions) is a polynomial in of degree and is therefore . On the other hand, all natural numbers up to can be written as a product of at most primes. Therefore — a contradiction.