Here's a challange for everyone.

This is an algebra question:

Let Pn be the nth positive prime in the usual ordering. Use induction to prove that Pn <= 2^2^(n-1).

(Hint: Use proof of infinetly many primes)

Please help anyway you can.