Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Primeseasy
0:00.0

Euclid's proof of the infinitude of primes relies on constructing a number N=(p1×p2×⋯×pn)+1N = (p_1 \times p_2 \times \dots \times p_n) + 1N=(p1​×p2​×⋯×pn​)+1. What can we conclude about the prime factors of NNN?