1
answer
0
watching
146
views
6 Nov 2019
(Euclid) Prove that there areinfinitely many primes. [ Use proof by contradiction (Appendix A).Assume there are only finitely many primes p1 , p2 , . . . , pk, and reach acontradiction by showing that the number p1p2 ? ? ?pk `1 is not divisible by anyof p1,p2,...,pk.]
Show transcribed image text (Euclid) Prove that there are infinitely many primes. [ Use proof by contradiction (Appendix A). Assume there are only finitely many primes p1 , p2 , . . . , pk , and reach a contradiction by showing that the number p1p2 ? ? ?pk '1 is not divisible by any of p1,p2,...,pk.]
(Euclid) Prove that there areinfinitely many primes. [ Use proof by contradiction (Appendix A).Assume there are only finitely many primes p1 , p2 , . . . , pk, and reach acontradiction by showing that the number p1p2 ? ? ?pk `1 is not divisible by anyof p1,p2,...,pk.]
1
answer
0
watching
146
views
For unlimited access to Homework Help, a Homework+ subscription is required.
Jean KeelingLv2
19 Mar 2019