home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pipex!doc.ic.ac.uk!uknet!axion!spuddy!sweh
- From: sweh@spuddy.uucp (Stephen Harris)
- Newsgroups: comp.lang.pascal
- Subject: Re: Hash Coding Revisited -- need prime number generator
- Message-ID: <1993Jan2.234704.8574@spuddy.uucp>
- Date: 2 Jan 93 23:47:04 GMT
- References: <1993Jan1.042852.26677@netcom.com> <725883589snx@babel.DIALix.oz.au>
- Organization: Spuddy's Public Usenet Domain
- Lines: 24
-
- In article <725883589snx@babel.DIALix.oz.au> del@babel.DIALix.oz.au (D Elson) writes:
- >Sorry, I couldn't resist this one ...
-
- Ditto...
- >Proof (from a mathematician ...) 3 is prime, 5 is prime, 7 is prime,
- > therefore it is true by induction.
- >
- >Proof (from an engineer ...) 3 is prime, 5 is prime, 7 is prime, 9 is
- > an error of measurement, 11 is prime, ...
-
- From memory....
-
- Proof (from a physicist...) 1 is prime, 2 is prime, 3 is prime, 4 is prime,
- 5 is prime, 6 is prime....
-
- Proof (from a compsci...) 1 is prime, 1 is prime, 1 is prime, 1 is prime...
-
- No doubt there are many variations on this theme :-)
- --
-
- Stephen Harris
- sweh@spuddy.uucp ...!uknet!axion!spuddy!sweh
-
- * Meeeeow ! Call Spud the Cat on > +44 203 638780 < for free Usenet access *
-