Math, asked by BrainIyRaftaar, 1 month ago

What is proof that there are infinitely many prime numbers?​

Answers

Answered by Anonymous
9

Step-by-step explanation:

Theorem 2.1: For any integer n > 1, if p is a prime divisor of n! + 1 then p > n. Hence there are infinitely many primes.

Answered by UniqueDayan
9

Answer:

\huge{❥}{\mathtt{{\purple{\boxed{\tt{\pink{\red{A}\pink{n}\orange{s}\green{w}\blue{e}\purple{r᭄}}}}}}}}❥

Assume there are a finite number, n , of primes , the largest being p n .

Consider the number that is the product of these, plus one: N = p 1 ... p n +1.

Similar questions