There are equally spaced knots in the loop of string in Figure-1 . This string loop can be transformed into Figure-2 , which is a right triangle with a knot on each of its vertices.
Does this same transformation work for any other number of knots ?
Find the minimum
.
If there is no such
, enter 0.
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.
Note that we can represent any Pythagorean triplet as ( m ( u 2 − v 2 ) , 2 m u v , m ( u 2 + v 2 ) ) for some integers u > v > 0 ; m > 0 and that k is just the sum of the sides (assuming that the distance between two consecutive knots is 1).
Also, notice ( 6 , 8 , 1 0 ) gives k = 2 4 .
We prove that for k < 2 4 , no right triangle exists. This is same as showing that the following equation has no integer solutions :
k = 2 m u 2 + 2 m u v
We see that no solutions exist if k is odd. This narrows it down to k = 1 4 , 1 6 , 1 8 , 2 0 , 2 2 .
Now, put k = 2 n so that the equation now becomes the following :
n = m u ( u + v )
Note that there is no solution for n being of the form p , p 2 or p 3 for some prime p .
This further narrows down the search to n = 1 0 . Exhaustion now shows that no solution exists.