PrimeGrid
Please visit donation page to help the project cover running costs for this month
1) Message boards : Sophie Germain Prime Search : Sophie Germain Prime Search (Message 18116)
Posted 4883 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 - 2023 Rytis Slatkevičius (contact) and PrimeGrid community. Server load 3.31, 4.67, 4.77
Generated 4 Feb 2023 | 3:39:52 UTC