For integers n ≥ 2 ,
n − 1 1 + n + 1 1 = q p ,
where p and q are positive coprime integers.
Is p 2 + q 2 a perfect square?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
U solved it very welly dude!CONGRATS! I thought to write a solution of my own but yours was so good that I have even upvoted it.CHEERS
+1 Isn't that surprising? It actually has to do with pythagorean triples .
@Chung Kevin : Here's your pythagorean triplet approach.
⟹ n − 1 1 + n + 1 1 n 2 − 1 2 n = = q p q p
A pythagorean triplet is of form:
( 2 m n , n 2 − m 2 , n 2 + m 2 )
Putting m = 1 we get,
( 2 n , n 2 − 1 , n 2 + 1 )
Since the term n 2 + 1 is the largest and so taking it as hypotenuse of a right triangle, with angle Φ opposite to side 2 n we get,
tan Φ = n 2 − 1 2 n
A similar right triangle can be constructed with angle Φ opposite to the side p .
Then,
tan Φ = q p
So, p and q are also sides of a right triangle containing the right angle.
Thereby, we conclude, by pythagoras theorem, that there exists some k which is an integer such that k 2 = p 2 + q 2 , hence coming to the conclusion that p 2 + q 2 is always a perfect square.
Note that this works for ∣ n ∣ ≥ 2 , where n ∈ Z since there is no defined triplet for 0 ≤ ∣ n ∣ ≤ 1 , noting that n ∈ Z .
I think you should have mentioned ∣ n ∣ ≥ 2 . Although this is not a problem since p and q are positive. But just for clarity.
I created this problem by setting m = 1 and then asking what does n 2 − m 2 2 m n look like. I was slightly surprised to find the nice partial fraction decomposition.
I stated that n ≥ 2 . I stated that p , q are positive and coprime in order to uniquely define them, though of course neither of these conditions are necessary. For simplicity, I didn't want to deal with negative / varying values of p , q .
Problem Loading...
Note Loading...
Set Loading...
W e h a v e , n − 1 1 + n + 1 1 = q p B y s o l v i n g , n 2 − 1 2 n = q p p 2 + q 2 = ( 2 n ) 2 + ( n 2 − 1 ) 2 p 2 + q 2 = 4 n 2 + n 4 + 1 − 2 n 2 p 2 + q 2 = n 4 + 1 + 2 n 2 p 2 + q 2 = ( n 2 + 1 ) 2 B y s q u a r e r o o t i n g b o t h t h e s i d e s , p 2 + q 2 = ( n 2 + 1 ) H e n c e p 2 + q 2 i s p e r f e c t s q u a r e a l w a y s