prove that prime numbers are infinite????
give correct answer if you know otherwise don't answer.....
wrong answer will be reported.....
Answers
Answered by
2
Yes. If you assume there are a finite number prime numbers, then a list of them would look like a1, a2, ..., an. If you can make this number...
(a1)(a2)(a3)...(an) + 1
...then dividing this number by any of the known primes, you would have a remainder of 1, so therefore this number is a prime. This is a contradiction that the primes are finite, so the primes must be infinite.
(a1)(a2)(a3)...(an) + 1
...then dividing this number by any of the known primes, you would have a remainder of 1, so therefore this number is a prime. This is a contradiction that the primes are finite, so the primes must be infinite.
singindre824:
bhai le
dekhele mera answer
thx
now it is cool
Similar questions