## What is Diophantine Equation?

Diophantine Equation is introduced by a mathematician Diaphantus of Alexandria.

It is an algebraic equation having two or more unknown for which rational or integral solutions are required.

The first general solution of Linear Diophantine Equation gave by a mathematician Brahmagupta who used the complicated notations for solving such equations but Diophantus did not utilize complicated algebraic notation.

Linear Diophantine Equation of two variables is given by,

Where, a, b and c are integers and x and y are variables. Few examples of Diophantine Equations are given here.

It is not necessary that all Diophantine equations are solvable, for example, , there is no integer solution of this equation.

Hence, the linear Diophantine equation has a finite number of solutions, e.g. 3x = 6.

Hilbert proposed twenty-three most essential unsolved problems of 20^{th} century and his tenth problem was the solvability a general Diophantine equation.

He also asked for a general method of solving all Diophantine equations. Furthermore, Glodbach’s theory is his eighth problem.

In 1930, Godel, Turing, Kleene develop the theory of computability and Universal Turing Machine invented by Turing in 1946 and discovered fundamental unsolvable problems.

However, in 1970, Yuri Matiyasevich proved that the Diophantine problem is not solvable by stating that **“ there is no algorithm which, for a given arbitrary Diophantine equation, would tell whether the equation has a solution or not”.**

Furthermore, Anderson and Ogilvy give a number of Diophantine equations with known and unknown solutions in 1988.

**Read also: Types of Equations **

## Diophantine Analysis

It is a process which required for finding solutions to Diophantine equations. Some examples of linear Diophantine equations along with their solution are:

## Example No.1

**Find a particular and complete solution of a given equation**

**Solution**

First we find the Greatest Common Divisor (GCD),

Now apply the Extended Euclidian Algorithm,

Therefore, a particular solution is,

And the complete solution is

## Example No.2

**Find a particular and complete solution of a given equation**

**Solution**

First we find the Greatest Common Divisor (GCD),

Now apply the Extended Euclidian Algorithm,

Therefore, a particular solution is,

And the complete solution is

## Example No.3

**Find a particular and complete solution of a given equation**

**Solution**

First we find the Greatest Common Divisor (GCD),

Therefore,

Hence, there is no solution because 2 does not divide 5.

Download: Diophantine Equations pdf

See also: **Types of Differential Equations**