A set of four distinct real numbers is called round if it satisfies ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ x 1 2 + x 2 = 2 , x 2 2 + x 3 = 2 , x 3 2 + x 4 = 2 , x 4 2 + x 1 = 2 , and x 1 = min ( x 1 , x 2 , x 3 , x 4 ) .
How many round sets are there?
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.
Problem Loading...
Note Loading...
Set Loading...
We will ignore the condition that x 1 is the minimum, and apply it right at the end.
First we will show that all x i are between − 2 and 2 . Clearly, x 1 = 2 − x 4 4 ≤ 2 , and similarly for the other x i . To show that x 1 cannot be less than − 2 , we will use the following simple lemma.
Lemma. If a < − 2 , then 2 − a 2 < a .
Proof. Because a 2 + a − 2 = ( a − 1 ) ( a + 2 ) , it is positive for a < − 2 , which implies the desired inequality.
Now suppose that x 1 < − 2 . Applying the above lemma four times, we get x 1 > x 2 > x 3 > x 4 > x 1 , a contradiction.
So − 2 ≤ x 1 ≤ 2 . Therefore we can write x 1 = − 2 cos t . Therefore, x 2 = 2 − x 1 2 = − 2 ( 2 cos 2 t − 1 ) = − 2 cos 2 t . Similarly, x 3 = − 2 cos 4 t , x 4 = − 2 cos 8 t , x 1 = − 2 cos 1 6 t . So cos t = cos 1 6 t , and this condition is both necessary and sufficient.
This is equivalent to 1 6 t = ± t + 2 π k , for some integer k . We will distinguish two cases.
Case 1. 1 6 t = t + 2 π k . Then 1 5 t = 2 π k , t = 1 5 k ⋅ 2 π . Clearly, it is enough to consider k = 0 , 1 , 2 , . . . , 1 4 to get all possible values of cos t . Moreover, cos t = cos ( 2 π − t ) , so it is enough to consider k = 0 , 1 , . . . , 7 .
If k = 0 , then 2 k = 4 k = 8 k = 0 , we will write this as ( 0 , 0 , 0 , 0 ) . This does not satisfy our condition that the four numbers are distinct.
If k = 1 , then we get ( 1 , 2 , 4 , 7 ) (note that 8 = 1 5 − 7 . Similarly, if k = 2 , we get ( 2 , 4 , 7 , 1 ) . We also get ( 4 , 7 , 1 , 2 ) and ( 7 , 1 , 2 , 4 ) . These lead to the same set of four distinct numbers, so we have found one round set.
If k = 3 , we get ( 3 , 6 , 3 , 6 ) , so the four numbers are not distinct. If k = 5 , we get ( 5 , 5 , 5 , 5 ) , which is also not allowed. Since all values of k have been accounted for, there is exactly one round set coming from this case.
Case 2. 1 6 t = − t + 2 π k . Then 1 7 t = 2 π k , t = 1 7 k ⋅ 2 π . As in Case 1, we can restict our attention to k = 0 , 1 , 2 , . . . , 1 6 and then to k = 0 , 1 , . . . , 8 . A simple analysis, like in Case 1, gives the following solutions:
( 0 , 0 , 0 , 0 ) discarded because the numbers are the same (it is also the same as the ( 0 , 0 , 0 , 0 ) from Case 1, it corresponds to x 1 = x 2 = x 3 = x 4 = − 2 ).
( 1 , 2 , 4 , 8 ) , ( 2 , 4 , 8 , 1 ) , ( 4 , 8 , 1 , 2 ) , ( 8 , 1 , 2 , 4 ) . These give the same round set.
( 3 , 6 , 5 , 7 ) , ( 6 , 5 , 7 , 3 ) , ( 5 , 7 , 3 , 6 ) , ( 7 , 3 , 6 , 5 ) . This is another round set.
So, altogether there are 3 round sets.