I'm having trouble with showing that there are infinitely many primes in the sequence 3n + 2 (and I'd also need to follow by answering to what other sequences can this argument be applied?)

---

I assume I start off by let p1 < p2 < ... < pk be a finite list of primes of a the sequence 3n +2. Then also Let N = 3p1*p2*....*pk + 2.

Not sure where to go from here?

djino

"Thanks for your help!"