You may search at google for the paper "Prime is in P" for a P algorithm.
Note this algorithm is not that fast when given n is small. On Thu, Jun 19, 2008 at 1:55 PM, zee <[EMAIL PROTECTED]> wrote: > > hi everyone ... > > any efficient algo to find a number is prime or not ??? > > (i agree the question is childish but i am new to algorithms .. please > help me )) > > > > -- "If you received this communication by mistake, please don't forward it to anyone else (it may contain confidential or privileged information), please erase all copies of it, including all attachments, and please let the sender know it went to the wrong person. Thanks." --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
