Waste less time on Facebook — follow Brilliant.

AKS-Test. Primality Testing

I was writing a coursework piece with the title 'Can primes be described by formulae?' (Anyone else take the IB course?), where I came across the AKS-Test. Essentially, this states that:

For all \(0<k<n, n|^nC_k\) iff \(n\) is prime.

Using this fact (and after some modification), the AKS-Test was made by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, which can determine whether an integer is prime or not deterministically and at polynomial time too.

My challenge for you is to prove the above statement.

Note by Jihoon Kang
2 years, 1 month ago

No vote yet
1 vote


Sort by:

Top Newest


\[k{n\choose k}=n {{n-1}\choose {k-1}}\] Mursalin Habib · 2 years, 1 month ago

Log in to reply

By Lucas' Theorem, if \(n\) is prime then \(\dbinom{n}{k}\equiv \dbinom{1}{0}\cdot \dbinom{0}{k}\equiv 0\pmod{n}\).

Lucas' Theorem doesn't work for the converse though. Daniel Liu · 2 years, 1 month ago

Log in to reply

@Daniel Liu I never heard of Lucas' Theorem before. Thanks for bringing it to my attention. Jihoon Kang · 2 years, 1 month ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...