Fool-Proof Test for Primes - Numberphile
The AKS Test has been a major break-through in the search for Prime Numbers. More links & stuff in full description below ↓↓↓ See the previous video about Fermat's Prime Test at: http://yo...
==========
>> DR GRIME: In 2002 mathematicians published a new method to test for primesand finally they found a fast way that was 100%. This is now one of the latest things.So this is called that AKS test. And it's pretty much a very similar idea to what wedid with the Fermat Little Theorem. It's very similar to that. And the test is, that ifyou've got a number p and we are going to do this. We're going to take (x - 1)to the power p and then we're going to subtract (x^p - 1). Alright.So it's a polynomial, I'll show you an example in a second. If all coefficients are divisibleby p then p is prime. And if they're not it's composite. it's 100% this test. I'll showyou an exampl...
==========
>> DR GRIME: In 2002 mathematicians published a new method to test for primesand finally they found a fast way that was 100%. This is now one of the latest things.So this is called that AKS test. And it's pretty much a very similar idea to what wedid with the Fermat Little Theorem. It's very similar to that. And the test is, that ifyou've got a number p and we are going to do this. We're going to take (x - 1)to the power p and then we're going to subtract (x^p - 1). Alright.So it's a polynomial, I'll show you an example in a second. If all coefficients are divisibleby p then p is prime. And if they're not it's composite. it's 100% this test. I'll showyou an exampl...
