Prove that \(\sum 1 / p\) diverges; the sum extends over all primes. (This shows
that the primes form a fairly substantial subset of the positive integers.)
Hint: Given \(N\), let \(p_{1}, \ldots, p_{x}\) be those primes that divide at
least one integer \(\leq N\). Then
$$
\begin{aligned}
\sum_{n=1}^{N} \frac{1}{n} & \leq
\prod_{j=1}^{k}\left(1+\frac{1}{p_{j}}+\frac{1}{p^{2}}+\cdots\right) \\
&=\prod_{=1}^{k}\left(1-\frac{1}{p_{j}}\right)^{-1} \\
& \leq \exp \sum_{j=1}^{k} \frac{2}{p_{j}}
\end{aligned}
$$
The last inequality holds because
$$
(1-x)^{-1} \leq e^{2 x}
$$
if \(0 \leq x \leq t .\)
(There are many proofs of this result. See, for instance, the article by
I. Niven in Amer. Math. Monthly, vol. 78,1971, pp. \(272-273\), and the one by
R. Bellman in Amer. Math. Monthly, vol. 50,1943, pp. \(318-319 .\) )