The elliptical curve method is one of the better ways to prove primality for numbers which don't follow a special form.
A web applet to test numbers up to 10^200 or so. http://www.alpertron.com.ar/ECM.HTM Primo can prove very large numbers to be prime (or show them to be composite). I have used it for numbers up to 10^3000, but others have gone well beyond that. http://www.ellipsa.net/ Don On Feb 11, 8:52 am, rspr <ravishanker....@gmail.com> wrote: > How can we check for the primality fhttp://www.alpertron.com.ar/ECM.HTMor > very large number like 10^20 or > more. It is not stored in integer So integer operation would not work > on it. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
