Explore BrainMass

Explore BrainMass

    Diophantine equation

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    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.

    © BrainMass Inc. brainmass.com March 4, 2021, 6:03 pm ad1c9bdddf
    https://brainmass.com/math/algebra/proof-solution-involving-diophantine-equation-26408

    Solution Preview

    Please see the attached file.

    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.

    First, we will prove the statement:

    x^2-y^2=n is solvable in integers if and only if n is odd or n is divisible by 4.

    We need to show that "if x^2-y^2=n is solvable in integers, then n is odd or n is divisible by 4"
    Proof. We know that and have the same parity since (x+y)+(x-y)=2x is even. Since x^2-y^2=n is solvable in integers and , we have
    Case 1: x+y is odd
    Then x-y must be odd. So, is odd.
    Case 2: x+y is even
    Assume that . Then x-y must be even, say . So,
    ...

    Solution Summary

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

    $2.49

    ADVERTISEMENT