anyone can answer this question????
Answers
Okay, here, n is an odd no. except 1.
So let n = 2k + 1 for any positive integer k.
So,
So we get that,
is a Pythagorean triplet.
So this is the actual proof. Hope this may be helpful to you. ^_^
Let me tell something more about this.
WHY n ≠ 1?
Because , a member of the Pythagorean triplet, becomes zero.
WHY n CAN'T BE EVEN?
Because if n is even, the other two members of the Pythagorean triplet,
won't be positive integers, as both n² - 1 and n² + 1 becomes odd.
But even it won't be a Pythagoren triplet, the sum of squares of first two is equal to the square of the third.
Let me show you.
Let n = 2k.
So here we also get that
So we can say that these are also Pythagorean triplets according to this, but the largest two members of this triplet are not integers. So we can't say.
There's a lot more to say about it, but now I'm concluding my words.
But before, let me show you some examples.
If n = 3,
∴ (3, 4, 5) is a Pythagorean triplet.
If n = 5,
∴ (5, 12, 13) is a Pythagorean triplet.
If n=7
∴ (7, 24, 25) is a Pythagorean triplet.
Thank you. :-))