Also, if you want to build this into a program, you can get the NTL library. It includes a ZZ class which implements an extended precision integer type. It has a ProbPrime method which does a probabilistic test for primeness. It can handle numbers with thousands of digits.
http://www.shoup.net/ntl/ Don On Feb 11, 8:52 am, rspr <ravishanker....@gmail.com> wrote: > How can we check for the primality for 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.
