mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Prime Gap Searches

Reply
 
Thread Tools
Old 2021-09-23, 18:19   #56
CraigLo
 
Mar 2021

2·52 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
I don't know about the approach in its entirety, but I can confirm the congruence.
Thanks. The goal is to check primality with a single Fermat test. The problem is handling pseudoprimes. If a number is a pseudoprime then there is some prime p that divides it. As you have shown, this pseudoprime has the form n == p (mod mp). If we remove all possible pseudoprimes by sieving for numbers of this form with primes up to sqrt(N) then I think a single Fermat test should be sufficient to test the remaining numbers.
CraigLo is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Guess the next maximal prime gap. Bobby Jacobs Prime Gap Searches 6 2021-07-04 11:51
Gaps between maximal prime gaps Bobby Jacobs Prime Gap Searches 52 2020-08-22 15:20
Superprime gaps Bobby Jacobs Prime Gap Searches 5 2019-03-17 20:01
Top 50 gaps robert44444uk Prime Gap Searches 1 2018-07-10 20:50
Gaps and more gaps on <300 site gd_barnes Riesel Prime Search 11 2007-06-27 04:12

All times are UTC. The time now is 18:42.


Thu Sep 23 18:42:41 UTC 2021 up 62 days, 13:11, 1 user, load averages: 2.49, 1.82, 1.67

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.