Analytic Number Theory

MTH 435

Dr Mohib Ali
 Review of Lecture 9

 Chinese Remainder Theorem (Proof)

 Examples of CRT

 Indirect Examples where CRT can be applied

Prime Numbers
 Congruences with primes

•Theorem:
  Let be an odd prime and suppose does not divide . If there exists a
number such that then the congruence
has precisely two incongruent solutions modulo .

Proof:
 Behavior as FTA

Two solutions as of the quadratic equation.

 Remarks

•Case
  about and composite numbers.
 Dirichlet Theorem

•Let   be prime and suppose If the congruence does not have a solution, then If
the congruence has a solution then

Proof:
 Wilson’s Theorem

•If is  prime, then .

 Euler’s Criterian

•Let   be an odd prime and suppose . Then is solvable or not solvable according
as or .
 Application

•Theorem:
  Let be an odd prime. Then the congruence has a solution if if of the
form and does not have a solution if is of the form .

Proof:
 Review of Lecture 10

 Quadratic congruences with prime modulo

 Dirichlet Theorem

 Wilson’s Theorem

 Euler’s Criteria