Let x,y,z be integers satisfying a specific condition, which boils down to(adsbygoogle = window.adsbygoogle || []).push({});

[itex]5|(x+y-z)[/itex] and [itex]2*5^{4}k=(x+y)(z-y)(z-x)((x+y)^2+(z-y)^2+(z-x)^2)[/itex]

or equivalently [itex]5^{4}k=(x+y)(z-y)(z-x)((x+y-z)^2-xy+xz+yz)[/itex]

I want to show that GCD(x,y,z)≠1, starting with the assumption 5 dividing (x+y), (z-y), or (z-x) results in x,y or z being divisible by 5. then it's easy to show that 5 divides another term, implying 5 divides all three.

I run into trouble assuming 5 divides the latter part, [itex]2((x+y)^2+(z-y)^2+(z-x)^2)=((x+y-z)^2-xy+xz+yz)[/itex] and showing the contradiction from that point.

Any hints?

**Physics Forums - The Fusion of Science and Community**

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

# Trouble with deducing the contradiction

Loading...

Similar Threads - Trouble deducing contradiction | Date |
---|---|

I Trouble with exact sequence | Sep 15, 2016 |

Trouble understanding simple Galois Theory example | Feb 25, 2015 |

Trouble setting up to prove unique factorization | Aug 16, 2014 |

Having trouble understanding minimal polynomial problems | Jan 30, 2014 |

How is this a contradiction? | Feb 21, 2008 |

**Physics Forums - The Fusion of Science and Community**