Mathematics Homework Solutions
Problem
#26408

A proof and a solution involving a 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.

Solution
What is this?
By OTA - Overall OTA Rating
Changping Wang, MA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$19.95)
Included in Download
  • Plain text response
  • Attached file(s):
    • Diophantine equation.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n. - Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n.
  • Diophantine Equation - Let R be a PID. Consider the Diophantine equation ax+by=N where a,b and N are integers and a,b are nonzero. Suppose x_0, y_0 is a solution: ax_0+by_0=N. Prove that the full set of solutions to this eq ...
  • Discrete mathematics - Proper walk through of following proofs required ( for a better understanding ) --- 1) Prove that if n is an odd integer then n2 = 1 mod 8 2) Prove that 5n+3 is divisible by 4 for all intege ...
  • Sum of series - Determine the sum of the integers among the first 1000 positive integers which are not divisible by 4 or are not divisible by 9. (This is not an exclusive or)
  • Discrete Math - PROVE THAT 5 * 7^n + 3 * 11^n is divisible by 4 for all integers n >=0
Browse