 Fido Pascal Conference  PASCAL 
Msg  : 422 of 586                                                               
From : Joe Jared                           1:125/1212.10        06 Jun 93  03:32 
To   : Jonathan Wright                     1:105/374.0                           
Subj : Prime Numbers...                                                       

In a message to Gary Morris <05 Jun 93 02:20> Jonathan Wright wrote:

 JW> I already see some ways to improve this
 JW> speedwise, but that excercise will be
 JW> left to the student :)

There are at least 2 formulas that can provide prime numbers with little
calculation.  If memory serves they are (N)^2+(N+1)^2 where N is Prime and
non-even, and (N)^2-(N-1)^2.  
---
 * Origin: 12 & 12 New Beginnings (510)834-6906 (RA 1:125/1212.10)

