|
|
back to boardI noticed that all primes in factorization of N are also strong pseudoprimes to base just 2 or 3. Added some tests on that. Thanks. Well, it's strange, but my program with primality test that checks for strong pseudoprimes to base 2 and 3 still gets AC. N = 25326001 The answer is 3, my program with weak primality test answers 2. Thanks, your tests have been added. 3 authors have lost their AC. Sorry, but can you give me 97 test, please? Forecoding, i guess i can help. Email me your TL97 code. I think it will be too hard to understand my code :) I don't really need to understand it too deeply to help, but oh well, as you wish. I get tired, so I send my code. Good luck :) |
|
|