Description: Implement AKS algorithm for primality testing, which was the
first polynomial time primality test that was devised. Read the paper attached and
implement the main algorithm. Implement for numbers of size max 64 bits. Bonus
marks will be given, if implemented for larger numbers using Library for big integers.
You can use C/C++ for it. Note for purposes of checking, print out the polynomial,
you get in the for loop each time, of the main algorithm(Step 5). And mainly print
out the answer, YES or NO for the primality
To Search:
File list (Check if you may need any files):
Q2.py
Download