1994-04-11 - Prime Numbers

Header Data

From: Jeremy Cooper <jeremy@crl.com>
To: cypherpunks@toad.com
Message Hash: 2a86b5df203a8a6ffb45f281cf70fc0454443217f427be9281dab6854082a325
Message ID: <Pine.3.87.9404101801.A23956-0100000@crl.crl.com>
Reply To: N/A
UTC Datetime: 1994-04-11 01:46:40 UTC
Raw Date: Sun, 10 Apr 94 18:46:40 PDT

Raw message

From: Jeremy Cooper <jeremy@crl.com>
Date: Sun, 10 Apr 94 18:46:40 PDT
To: cypherpunks@toad.com
Subject: Prime Numbers
Message-ID: <Pine.3.87.9404101801.A23956-0100000@crl.crl.com>
MIME-Version: 1.0
Content-Type: text/plain


I found something interesting that I have not proven, but it has not 
failed yet:

The integer N is prime if:

   2^N - 2
  ---------
      N              is an integer.

Don't ask how I found it, I was just fooling around.  Now:
   Is there some way to reverse the formula so we can insert and integer 
and get a prime number out?  Let me know, I am over excited.

                   _  .  _ ___ _  .  _
===-|)/\\/|V|/\/\ (_)/_\|_|\_/(_)/_\|_| Stop by for an excursion into the-===
===-|)||| | |\/\/  mud.crl.com 8888 (_) Virtual Bay Area!                -===







Thread