×

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, 8 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Hint:

$k{n\choose k}=n {{n-1}\choose {k-1}}$

- 2 years, 8 months ago

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.

- 2 years, 8 months ago

I never heard of Lucas' Theorem before. Thanks for bringing it to my attention.

- 2 years, 8 months ago