AKS test for primes: Difference between revisions

Line 4,532:
coef(n+1) // (I said it was out-by-1)
for i = 2 to n-1 // (technically "to n" is more correct)
if ! modint(c(i), /n) =<> 0c(i)/n then
return 0
end if
672

edits