Abstract

A probabilistic algorithm for testing primality of a large integer ‘ n’ is introduced. The algorithm is then compiled and run on the Pascal programming language. If the algorithm determines n is composite, the result is always true. If it determines n is prime, the result has an error. The probability of error is very small and depends on the numbers of random integers used by the algorithm within the processing.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call