Analytic Number Theory

MTH 435

Dr Mohib Ali
 Review of Lecture 3

 Euclidean Algorithm

 Extended Euclidean Algorithm

 Diophantine Equations and their solutions

Diophantine Equations
 Diophantine Equations

•Theorem:
  The equation has a solution in integers if and only if where . If and
is any particular solution of the equation then all solutions are given by
and
Where is any integer.

Proof:
 Diophantine Equations

Proof Continued …
Diophantine Equations
Diophantine Equations
 Examples

•Example:
  . First we guess any solution and then use previous result to find
other solutions.
 Examples

•Now  again we consider the same and use extended Euclidean algorithm.
 Some other examples

.•  
 Some Remarks

•If then
  we have always solution.
 Positive Solutions for Diophantine Equation

•Theorem:
  Let , and be positive integers with and suppose is any solution of .
Then the number of positive solutions of is the number of for which .

Proof:
 Review of Lecture 4

 Diophantine equations and their solutions

 Construction of solutions using extended Euclidean algorithm

 Diophantine equations and their solutions in positive integers.(without proof)