There are deterministic polyomial-time algorithm. [AKS-primality] Miller-Robin primality test is a non-deterministic primality test with almost zero chance of error. [All above based on some modification/improvement on fermat's theorem]
GNU Multi Precission library can be used to handle large integers/primes. -Moheed "I am who I am, no matter where I am or who I am with." * * On Sat, Feb 11, 2012 at 8:32 PM, shady <sinv...@gmail.com> wrote: > There are many, but the one i know how to code is fermat's primality test. > How to calculate all prime numbers between a given range efficiently i > read somewhere that we can do bit-masking to store whether a number is > prime or not, thus saving space ? > I generally use double prime sieve. > > On Sat, Feb 11, 2012 at 8:24 PM, rspr <ravishanker....@gmail.com> wrote: > >> what are the efficient ways to check that a given number is primer >> assuming the numbers can be large. >> >> -- >> 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. >> >> > -- > 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. > -- 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.
