PrimeGrid
Please visit donation page to help the project cover running costs for this month

Toggle Menu

Join PrimeGrid

Returning Participants

Community

Leader Boards

Results

Other

drummers-lowrise
1) Message boards : Sophie Germain Prime Search : Sophie Germain Prime Search (Message 18116)
Posted 4815 days ago by Bruno
@Alan: Actually the factor k is also a multiplicative time factor to compute the result with the LLR algorithm. The complexity is about k * complexity of prime-testing of (2^n-1).
[Return to PrimeGrid main page]
DNS Powered by DNSEXIT.COM
Copyright © 2005 - 2022 Rytis Slatkevičius (contact) and PrimeGrid community. Server load 4.54, 3.64, 3.53
Generated 28 Nov 2022 | 7:56:08 UTC