Article View: sci.crypt
Article #644Re: tabulation of primes
From: George Mitchell
Date: Wed, 12 Aug 1992 17:16
Date: Wed, 12 Aug 1992 17:16
18 lines
1108 bytes
1108 bytes
graef@rs5.hrz.th-darmstadt.de (Ulrich Graef) writes: >You must notice, that there exists a small community (even with >mathematicians among them) which does not believe in inductive >proofs. I think, they have a lot of problems with commonly >accepted theorems. Whoa! Euclid's proof does not involve induction! It is a reductio ad absurdum proof, which shows that the premise: Assume that there is a largest prime n. leads to a contradiction, and therefore the premise cannot be true. You are correct that some people worry about inductive proofs, but their worries fortunately do not apply here. George Mitchell (george@tessi.com)
Technical Details
Message-ID:
<1992Aug12.171656.8755@tessi.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!tessi!georgeReferences:
<9208101729.AA24006@gandalf.ssw.com> <1557@anagld.analytics.com> <Bstqr2.Lxq@cs.columbia.edu> <1992Aug12.152948.39350@news.th-darmstadt.de>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!tessi!george From: george@tessi.com (George Mitchell) Subject: Re: tabulation of primes Message-ID: <1992Aug12.171656.8755@tessi.com> Organization: Test Systems Strategies, Inc., Beaverton, Oregon References: <9208101729.AA24006@gandalf.ssw.com> <1557@anagld.analytics.com> <Bstqr2.Lxq@cs.columbia.edu> <1992Aug12.152948.39350@news.th-darmstadt.de> Date: Wed, 12 Aug 1992 17:16:56 GMT Lines: 18