Appendix to Perrin Pseudoprimes

A fourteen bit binary Prime number sieve 00000100010101 is found from the Euler phi transform of the Perrin sequence.

Appendix_to #13_Perrin_Pseudoprimes

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s