This module considers fundamental problems in number theory, related to the distribution of prime numbers and integer solutions to Diophantine equations. Students will learn the core concepts in number theory such as the existence of primitive roots modulo a prime, quadratic reciprocity and solving Pell's equation. Additionally, students will learn how to develop and implement algorithms to efficiently solve computational questions which arise in number theory.

Sorry, there are no lists here yet. You could try:

  • Clicking My Lists from the menu. Your course enrolled lists are stored here.
  • Searching for the list using the form below:

Lists linked to Number Theory

There are currently no lists linked to this Module.