Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84 (Fortune 01.1b1); site graffiti.UUCP
Path: utzoo!linus!philabs!cmcl2!seismo!ut-sally!ut-ngp!shell!graffiti!peter
From: peter@graffiti.UUCP (Peter da Silva)
Newsgroups: net.jokes
Subject: Re: From Sun_Man
Message-ID: <300@graffiti.UUCP>
Date: Sun, 13-Oct-85 23:03:22 EDT
Article-I.D.: graffiti.300
Posted: Sun Oct 13 23:03:22 1985
Date-Received: Tue, 15-Oct-85 06:40:44 EDT
References: <1100@princeton.UUCP> <491@aero.ARPA> <1423@teddy.UUCP>
Distribution: net
Organization: The Power Elite, Houston, TX
Lines: 11

> >>Question:  prove all odd numbers are prime.
> 
> Programmer:	Everybody knows that has table lengths should be prime.
> 		My hashing routine doesn't work with any prime numbers, and
> 		it foesn't work with any numbers at all, therefore there
> 		are no prime numbers.

No no no... watch...

Programmer:	OK, let me write a program to test it out. There! You see!
		1 is a prime, 1 is a prime, 1 is a prime, 1 is a prime...