10
$\begingroup$

new user here. Where does a layman go to get a basic understanding of AKS primality testing. I am not talking about the optimal choice of "r" (which I am told is the hardcore number theoretic part of the algorithm). I mean basic things, like what does "mod(n, x^r-1)" mean (how can something be mod two things?) And what does binomial expansion have to do with anything. I can't find anything in Wikipedia that is appropriate for my level. Thanks.

  • 2
    Please tell us more about "your level". Do you know about congruence arithmetic and/or the ring of integers modulo m, and, if so, are you familiar with polynomials over such rings?2011-07-18
  • 2
    @Gary: If you will ask specific questions here, we can address them directly as well.2011-07-18
  • 0
    I know about integers modulo m, but not polynomials.2011-07-18
  • 0
    Thank you all. Very helpful responses.2011-07-19

3 Answers 3