Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 exptools 1/6/84; site ihuxl.UUCP
Path: utzoo!watmath!clyde!burl!we13!ihnp4!ihuxl!seifert
From: seifert@ihuxl.UUCP (D.A. Seifert)
Newsgroups: net.jokes
Subject: Re: Odd primes
Message-ID: <1076@ihuxl.UUCP>
Date: Wed, 2-May-84 09:10:58 EDT
Article-I.D.: ihuxl.1076
Posted: Wed May  2 09:10:58 1984
Date-Received: Thu, 3-May-84 08:36:25 EDT
References: <1264@uvacs.UUCP> <443@ihlts.UUCP> <1720@mit-eddie.UUCP>
Organization: AT&T Bell Labs, Naperville, IL
Lines: 46

as long as everyone else is......

Engineer's proof:

	3 is a prime, 5 is a prime, 7 is a prime,

	Oh nuts! My calculator just died!


Engineering Professor's proof:

	3 is a prime, the rest are left as an exercise for the student.
	
	
C Programmer's proof:

	3 is a prime, 5 is a prime, 7 is a prime, 9 would
	have been a prime if I would have typed
	(long)**foo.bar.prime.nonsense+++=--*odd.number;
	instead of
	(long)**foo.bar.prime.nonsense++-=--*odd.number;

	
FORTRAN Programmer's proof:

	Can't be done. FORTRAN can't tell the difference
	between odd numbers and even numbers.

	
COBOL Programmer's proof:

	What's a "prime" ?
	
and now, for the one you all have been waiting for:

USENET reader's proof:

	Sorry, if I took time for contructing proofs I'd
	have to unsubscribe from something.
	
-- 
	_____
       /_____\	   	    That auto-crossing beagle,
      /_______\			      Snoopy
	|___|		    BMWCCA, Windy City Chapter
    ____|___|_____	       ihnp4!ihuxl!seifert