- **Math**
(*https://www.mersenneforum.org/forumdisplay.php?f=8*)

- - **Solovay Strassen Mod**
(*https://www.mersenneforum.org/showthread.php?t=25793*)

Solovay Strassen Mod1 Attachment(s)
In the Solovay strassen primality test we can can make the the base a=2 and another a or b such that the jacobi symbol is the opposite sign of that of the jacobi of 2 with respect to n the odd composite number which we need to determine the primality of. Please comment on the paper I attached and the algorithm in pseudo code.
Thank you, Allan |

This is empirically true only so farThis is only empirically determined to be true for all base 2 Euler pseudo primes uptil 2^64-1 but the proof given is not correct as it includes circular reasoning. My stupid error in posting it up. But the algorithm described there seems to be empirically correct. If any one else could find a reasonable proof it would be good.
Sorry, Allan |

1 Attachment(s)
Attached is the code I tested it with in C. It uses GMPLIB [url]http://gmplib.org[/url]
Compile it as : gcc -o pspf -lm -m64 -lgmp pspfactorsm.c and run : ./pspf filename.out filename,in where filename.in = psps-below-2-to-64.txt The file psps-below-2-to-64.txt is unput to the program and filename.out is the output file. The file psps-below-2-to-64.txt can be found at the following URL: [url]http://www.cecm.sfu.ca/Pseudoprimes/[/url] Decompress the file and use it. Thank you, Allan |

1 Attachment(s)
Soory the correct code is here. The former code has j=0. It should be j=ja;
Thank you. Allan |

In the Theorem proof the error is here:
2^(n-1)==1 ( mod n) = 1 (mod p) as p | n b^(n-1)==1( mod n) == 1 (mod p) as p | n Subtracting the two equivalences gives: 2^(n-1)==b^(n-1) ( mod p) Taking the square roots of both sides gives: 2((n-1)/2)==+/- b^((n-1)/2)( mod p) and not 2^((n-1)/2) == b^((n-1)/2) (mod p) as claimed in the proof. |

All times are UTC. The time now is 09:28. |

Powered by vBulletin® Version 3.8.11

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.