elemenary number theory

  1. E

    How to evaluate the greatest common divisor?

    What are the advantages of using Euclid's algorithm over prime decomposition to find the gcd of two numbers? Should you use Euclid’s algorithm in some cases and prime decomposition in others?
  2. E

    quadratic residues

    IS there an efficient way to find the square roots of a modulo p where p is prime?
  3. E

    What is the most motivating way to introduce primitive roots?

    I am teaching elementary number theory to first year undergraduate students. How do introduce the order of an integer modulo n and primitive roots? How do I make this a motivating topic and are there any applications of this area? I am looking at something which will have an impact. These...