It is not the case that AKS checks divisibility by polynomials over Z/nZ, requiring bit operations proportional to log(n)² or higher per polynomial test.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.