Let be the greatest prime, less or equal than , then can only be divisible by primes greater than ( see here), thus,let be a prime number satisfying then (1) ( since otherwise we'd contradict our definition of )

From it follows that if ( show by induction that for all )

Thus, since we have (2)

(1) and (2) complete the proof for