The product is \(2\cdot 3\cdot 5\cdot 7 = 210\), and \(210+1 = 211\) is prime, with no prime in the list dividing it. The option with 213 fails because \(213 = 3\cdot 71\).
The infinitude of primes is Euclid's theorem stating that the set of prime numbers is infinite: given any finite list of primes \(p_1,\dots,p_n\), there is a prime not on it.
\[p\mid p_1p_2\cdots p_n+1\ \Longrightarrow\ p\neq p_i\ \text{for all } i\]