Share
Explore BrainMass

Diophantine equation

Show that the Diophantine equation x^2-y^2=n is solvable in integers if and only if n is odd or n is divisible by 4. When this equation is solvable, find all integer solutions.

Solution Summary

This show show to prove that a Diophantine equation is solvable in integers if and only if certain circumstances are met.

$2.19