Primitive Inverse Pythagorean Triplets

Define a primitive inverse Pythagorean triplet as any ordered triplet ( x , y , z ) (x,y,z) where x , y , z Z + x,y,z\in\mathbb{Z}^+ and gcd ( x , y , z ) = 1 \gcd{(x,y,z)}=1 such that 1 x 2 + 1 y 2 = 1 z 2 \frac{1}{x^2}+\frac{1}{y^2}=\frac{1}{z^2}

Which of the following statements are true for any primitive inverse Pythagorean triplet ( x , y , z ) (x,y,z) where 1 x 2 + 1 y 2 = 1 z 2 \frac{1}{x^2}+\frac{1}{y^2}=\frac{1}{z^2} ?

  • A: There are infinitely many primitive inverse Pythagorean triplets.
  • B: Each of x z y \large\frac{xz}{y} , y z x \large\frac{yz}{x} , and x y z \large\frac{xy}{z} will be perfect squares.
  • C: ( x , y , x 2 + y 2 ) (x,y,\sqrt{x^2+y^2}) will form a Pythagorean triplet (in other words, x 2 + y 2 \sqrt{x^2+y^2} is an integer).

If you enjoyed this problem, you might want to check this and this out too.

Only C Only B and C Only B Only A and B Only A and C Only A A, B, and C

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.

1 solution

Nick Turtle
May 6, 2018

Note that 1 x 2 + 1 y 2 = 1 z 2 z = x y x 2 + y 2 \begin{aligned}\frac{1}{x^2}+\frac{1}{y^2}&=\frac{1}{z^2} \\z&=\frac{xy}{\sqrt{x^2+y^2}}\end{aligned}

Since z z is an integer, so must x 2 + y 2 \sqrt{x^2+y^2} be an integer. Therefore, option C is definitely true.

Now, since z z is an integer, it also follows that x 2 + y 2 \sqrt{x^2+y^2} must divide x y xy . In other words, there must exist a certain integer d 2 d\ge 2 which divides both x x and y y . Choose d d such that it is the greatest common factor of x x and y y , or d = gcd ( x , y ) d=\gcd{(x,y)} .

Then, rewrite the above expression with x = d m y = d n \begin{aligned}x&=dm\\ y&=dn\end{aligned}

This gives z = d m d n d 2 m 2 + d 2 n 2 = d m n m 2 + n 2 \begin{aligned}z&=\frac{dm\cdot dn}{\sqrt{d^2m^2+d^2n^2}}\\ &=\frac{dmn}{\sqrt{m^2+n^2}}\end{aligned}

Due to how we defined d d , m 2 + n 2 \sqrt{m^2+n^2} cannot divide m n mn . Now, since the left-hand side is an integer, we have that d = k m 2 + n 2 d=k\sqrt{m^2+n^2} for an integer k k . Thus, x = d m = k m m 2 + n 2 y = d n = k n m 2 + n 2 z = x y x + y = k m n \begin{aligned}x&=dm=km\sqrt{m^2+n^2}\\ y&=dn=kn\sqrt{m^2+n^2}\\ z&=\frac{xy}{x+y}=kmn\end{aligned}

Now, as gcd ( x , y , z ) = 1 \gcd{(x,y,z)}=1 , we must choose k = 1 k=1 . Then, x = m m 2 + n 2 y = n m 2 + n 2 z = m n \begin{aligned}x&=m\sqrt{m^2+n^2}\\ y&=n\sqrt{m^2+n^2}\\ z&=mn\end{aligned}

Obviously, m 2 + n 2 \sqrt{m^2+n^2} is an integer. Using what we know from studying Pythagorean triplets, we can say that, for some s s , t t , and r r , m = r ( s 2 t 2 ) n = 2 r s t \begin{aligned}m&=r(s^2-t^2)\\ n&=2rst\end{aligned}

Using this to rewrite x x , y y , and z z : x = r 2 ( s 2 + t 2 ) ( s 2 t 2 ) y = 2 r 2 s t ( s 2 + t 2 ) z = 2 r 2 s t ( s 2 t 2 ) \begin{aligned}x&=r^2(s^2+t^2)(s^2-t^2)\\ y&=2r^2st(s^2+t^2)\\ z&=2r^2st(s^2-t^2)\end{aligned}

Again, set r = 1 r=1 so that gcd ( x , y , z ) = 1 \gcd{(x,y,z)}=1 : x = ( s 2 + t 2 ) ( s 2 t 2 ) y = 2 s t ( s 2 + t 2 ) z = 2 s t ( s 2 t 2 ) \begin{aligned}x&=(s^2+t^2)(s^2-t^2)\\ y&=2st(s^2+t^2)\\ z&=2st(s^2-t^2)\end{aligned}

Now, by inspection, we see that we can produce primitive inverse Pythagorean triplets by choosing s s and t t carefully. For example, setting t = s 1 t=s-1 always result in gcd ( x , y , z ) = 1 \gcd{(x,y,z)}=1 . This demonstrates that there are infinite primitive inverse Pythagorean triplets. Thus, option A is true.

With the above formulas, we can show that x z y \frac{xz}{y} , y z x \frac{yz}{x} , and x y z \frac{xy}{z} must be perfect squares. Thus, option B is also true.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...