mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 10 of 10
Search took 0.02 seconds.
Search: Posts Made By: zerothbase
Forum: Computer Science & Computational Number Theory 2011-04-20, 18:50
Replies: 35
Views: 11,229
Posted By zerothbase
I believe the original intent of the thread was...

I believe the original intent of the thread was to find fast ways to prove primality up to a given limit.

It takes <3 minutes for my code to chew through the 2-SPRP list, and I've been told:


...
Forum: Other Mathematical Topics 2011-04-20, 18:15
Replies: 34
Views: 2,945
Posted By zerothbase
Here's a 7-witness for 64-bit: If n < 2^64...

Here's a 7-witness for 64-bit:

If n < 2^64 is a 2,325,9375,28178,450775,9780504,1795265022-SPRP, then n is prime

Found just by progressively finding a local-minima on which witness would...
Forum: Computer Science & Computational Number Theory 2011-04-19, 23:00
Replies: 35
Views: 11,229
Posted By zerothbase
Fast isPrime for n < 2^64

Fast isPrime for n < 2^64 attached.

Three static SPRP/Miller-Rabin tests w/ a hash to find the 4th test.

It seemed a little too easy to find this. I think with more computation time I could...
Forum: Computer Science & Computational Number Theory 2011-04-17, 02:59
Replies: 35
Views: 11,229
Posted By zerothbase
Found it (with some creative Googling) and...

Found it (with some creative Googling) and downloading now. thanks! I'll take a look and play with it a little bit.
Forum: Computer Science & Computational Number Theory 2011-04-17, 00:31
Replies: 35
Views: 11,229
Posted By zerothbase
Ya, but I haven't seen a straight download link...

Ya, but I haven't seen a straight download link for it the whole thing. Am I missing it? Has Feitsma (http://www.janfeitsma.nl/math/psp2/statistics) completed it yet? The statistics page shows red...
Forum: Computer Science & Computational Number Theory 2011-04-16, 20:25
Replies: 35
Views: 11,229
Posted By zerothbase
Attached is a code to extend this principle to...

Attached is a code to extend this principle to 1e15 (using William Galway's list (http://www.cecm.sfu.ca/Pseudoprimes/)) with only 2 miller-rabin tests.

It uses a SPRP-2, and a hash function to...
Forum: Computer Science & Computational Number Theory 2011-04-14, 04:03
Replies: 11
Views: 4,598
Posted By zerothbase
To some degree, I feel that finding any pairs...

To some degree, I feel that finding any pairs above ~190 million is just plain luck. I found many pairs between 150 million and 190 million, but it seems to be very very rare to see anything beyond...
Forum: Other Mathematical Topics 2011-04-10, 19:31
Replies: 34
Views: 2,945
Posted By zerothbase
I think what you are looking for is Knuth's...

I think what you are looking for is Knuth's Dancing Links, which is designed for covering sets. The rows being the bases you have and the columns being the pseudoprimes. The middle being the...
Forum: Computer Science & Computational Number Theory 2011-03-10, 23:42
Replies: 11
Views: 4,598
Posted By zerothbase
Below are the liars under signed int (2^31-1) for...

Below are the liars under signed int (2^31-1) for 11000544, 31481107, using the code in the attached java file.

Having no liars up to a high value is a generally a good indicator that it has few...
Forum: Computer Science & Computational Number Theory 2011-03-07, 22:16
Replies: 11
Views: 4,598
Posted By zerothbase
inspired by your work: if n < 316349281 and is...

inspired by your work:
if n < 316349281 and is a 11000544, and 31481107-SPRP, then n is prime.
Showing results 1 to 10 of 10

 
All times are UTC. The time now is 07:23.

Thu Jul 2 07:23:37 UTC 2020 up 99 days, 4:56, 0 users, load averages: 1.40, 1.32, 1.33

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.