You are Here: Home >< Maths

Proof help watch

1. Hi, I need to prove that if n divides any two of a, b, c for
+ = that will also divide the third.
(i.e. a, b, c is a pythagorean triple)

I have shown that divides using a=nq and b=nq' etc, but i dont know how to progress this proof further.

Thanks for any help
2. The second case you need to consider is n|a and n|c. Because a and b are symmetric, you can consider the other, third, case (namely, n|b, n|c) as following from this second case.

Bundling up the other two cases by just considering the second case is what is known as a "without loss of generality" (WLOG) step.
3. Isn't it similar to replacing a and b with np and nq, but instead of getting c^2 = (n^2)(p^2 + q^2), you get a^2 = (n^2)(p^2 - q^2)?

Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: February 9, 2010
The home of Results and Clearing

3,867

people online now

1,567,000

students helped last year
Today on TSR

IT'S TODAY!

A-level results chat here

University open days

1. Bournemouth University
Fri, 17 Aug '18
2. University of Bolton
Fri, 17 Aug '18
3. Bishop Grosseteste University
Fri, 17 Aug '18
Poll
Useful resources

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

How to use LaTex

Writing equations the easy way

Study habits of A* students

Top tips from students who have already aced their exams

Chat with other maths applicants