Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site sunybcs.UUCP
Path: utzoo!watmath!clyde!akgua!sdcsvax!sdcrdcf!hplabs!hao!seismo!rochester!rocksvax!sunybcs!allen
From: allen@sunybcs.UUCP (Seth Allen)
Newsgroups: net.jokes
Subject: all odd numbers are prime
Message-ID: <1588@sunybcs.UUCP>
Date: Thu, 10-May-84 16:16:33 EDT
Article-I.D.: sunybcs.1588
Posted: Thu May 10 16:16:33 1984
Date-Received: Sun, 13-May-84 08:48:57 EDT
Organization: SUNY/Buffalo Computer Science
Lines: 24




--------
Theorem:  All odd numbers are prime.
--------

------
Proof:  Two to the minus infinity power is zero,
------  therefore 0 is a power of 2.
        
        Every odd number is the sum of a prime
        and a power of 2.

        Therefore just add 0 to a prime and
        the result is an odd number,
        therefore all odd numbers are prime.

                    ---
                    QED
                    ---

>From the desk of someone who can't afford a pen,
that's why I'm using the network.