Prove that if p1, p2, …, and pn are distinct prime numbers with p1 = 2 and n > 1, then p1 p2 … pn + 1 can be written in the form 4k + 3 for some integer k.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.