Any pointers and/or help with proving the following would be appreciated(adsbygoogle = window.adsbygoogle || []).push({});

For every prime number n, there exist positive integers (k,l,m) such that

k(m^{2}-n^{2})=2(m^{3}+n^{3}-lm)

some examples (there could be several/many solutions for a given n)

{n,k,l,m}

{2, 14, 8, 2}

{3, 59, 264, 1}

{5, 53, 192, 3}

{7, 71, 264, 5},{7, 239, 6080, 1}

{11, 163, 1856, 5}

If the statement is true for prime n's, it can be shown to hold for composite n's as well.

Thanks, Mathador

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# K(m^2-n^2) = 2(m^3+n^3-lm)

**Physics Forums | Science Articles, Homework Help, Discussion**