>>"Pseudo-Prime Sieve" by Brian S. McMillan

>>Of the first 1000 pseudo-primes sampled,
>>785 were of the (PP -1)/3 = INT type.  While
>>only 142 were of the (PP +1)/3 = INT type.
>>While 73 were divisible by 3, which means
>>(PP± 1)/3 = Fraction.  So we will use only
>>those primes or pseudo-primes which
>>correspond to (EXP +1)/3 = INT which will
>>yield almost a 86% accuracy rating for a 
>>pseudo-primality test!  There are an infinite
>>number of primes... so this wont be a
>>problem.
>>While only 5 out of 1000 of the (EXP +1)/3
>>were still divisible by 5, we have to use the 
>>fundamental rule of divisibility first... for
>>obvious reasons.  Divide by 5,7,11,13...etc.
>>however a cap can now be set depending
>>on the level of accuracy one may wish to
>>achieve in relation to the (EXP ± 1)/3 test.
>>The equation:  PN (PN±2) = (2^P -2)/2...
>>Proves through a classic application of the
>>mathematical induction format there are an
>>infinite number of Primes and
>>Pseudo-Primes...heh,heh.
>>Now you might be asking yourself,  If you
>>have seen my other e-mails, and you know
>>that I'm working on a functional proof for
>>the Wilson Theorem...Why bother with this?
>>Because it's interesting and nobody has ever
>>thought of this particular line of reasoning
>>before...Try it, It really works!
>>Signed:  Brian S. McMillan, LUCKY MAN
>>PS.  I have noticed that a certain number of
>>dual compound pseudo-primes are of  a type
>>which corresponds to (P1+N)/P2 = (N+1)
>>WHERE: P1*P2 = Pseudo-Prime...For example
>>IF: 11*31 = 341
>>THEN: (31+2)/11 = 3
>>IF: 31*331 = 10261
>>THEN: (331+10)/31 = 11
>>IF: 173*101653 = 16585969
>>THEN: (101653+590)/173 = 591
>>There are primes which are not duality
>>compounded to reach pseudo-primes in
>>BASE 2 that obey the rule (P1+N)/P2 = (N+1)
>>IF: 37*19 = 703
>>THEN: (37+1)/19 = 2
>>There are also prime combinations
>>which correspond to (P1-N)/P2 = (N+1) such
>>IF: (23-1)/11 = 2
>>However, I did not find any of the last rule
>>combinations in all of the Pseudo-Primes
>>that I tested... Maby you can!
>>Visit: "www.godkings.com"