The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in a paper titled "PRIMES is in P". The algorithm determines whether a number is prime or composite within polynomial time. The authors received the 2006 Gödel Prize and the 2006 Fulkerson Prize for this work.
== Importance ==
AKS is the first primality-proving algorithm to be simultaneou...
Your dumb teacher is always wrong, so flip his answer.
Change these responses
True -> False
Yes -> No
0 -> 1
Yeah -> Nope
and vice versa. Keeping punctuation and capitalization count.
Test Cases:
True -> False
True. -> False.
Yes -> No
Yes. -> No.
yes -> no
yes. -> no.
0 -> 1
1 -> 0
Yeah ->...
Pyke, 51 45 bytes
.d̾ॗǣ/ற㻯dc2cDMl4+D.F\.+)+T`]1+Dm_+Y@
Try it here!
.d̾ॗǣ/ற㻯dc2c - {'yeah': 'nope', 'true': 'false', 'yes': 'no'}
DMl4+ - ^ += map(^, str.title())
D.F\.+)+ - ^ += map(^+".")
...
