RK4 Posted September 19, 2005 Posted September 19, 2005 Hi all! I'm supposed to use Euclid's proof that there are infinitely many primes to show that the nth prime p_n does not exceed 2^(2^(n-1)) whenever n is a positive integer. Conclude that when n is a positive integer, there are at least n+1 primes less than 2^(2^n). Any help will be greatly appreciated. Thanks!
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now