Seklorean Primes v3.0a

Description

With this new, fairly sensible and straightforward method you can generate highly probable primes beyond big. In candidates.txt an example that holds up to all testing so far is p5M# + p5M + 490.That is over 37 million digits!

Any probable prime discovered using these tools is to be called a Seklorean Prime. No more goofy formulae or whacky equations. The mystery has been conquered by yours truly.

Screenshots

Screenshot #5248

Archive Contents

Name Size
primes/Notes.txt 4.6 KB
primes/candidates.txt 482 bytes
primes/plist2.c 733 bytes
primes/primorial.c 972 bytes
primes/ptest.c 1.0 KB
primes/ptest2.c 1.1 KB
primes/ptestlong.c 1.6 KB
primes/sieve.c 3.5 KB
primes/validation/plist.c 1.3 KB
primes/validation/plist2.c 733 bytes
Download file
File Size
9.2 KB

Metadata

Author
seklorean
Uploaded
9 months, 3 weeks ago

Statistics

Rating
No ratings.
Downloads
343
Views
17

Reviews

Nobody has reviewed this file yet.

Versions

  1. Seklorean Primes v3.0a (published 9 months, 3 weeks ago; 2019-08-06 18:17 UTC)

Advertisement