Is there an infinite number of primes constructed as in Euclid's proof?
The question is :
Are there infinitely many primes of the form $p_1\cdot p_2\cdot...p_n+1$? ($p_k$ is the $k$-th prime.)
For example: $2\cdot3 + 1$.
But $2\cdot5+1$ is not included in the set of primes that i want demostrate, because 2 and 5 are not primes consecutive ... sorry for my English and thanks in advance