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.
Nicely done!
A similar solution was presented by Jon H., using − 2 cos θ instead of 2 cos θ and a degree argument instead of the inequalities to ensure that all real roots were found.
I had worked out that ∏ x i = ± 1 and ∏ ( x i + 1 ) = 1 and ∏ ( x i − 2 ) = 1 . Interesting to see how your answers fulfil those conditions :)
Let f ( x ) = 2 − x 2 . Then x 2 = 2 − x 1 2 = f ( x 1 ) . Similarly, x 3 = f ( x 2 ) , x 4 = f ( x 3 ) , and x 1 = f ( x 4 ) . Thus, solutions of the given system (without the minimum condition) correspond to solutions of the equation f 4 ( x ) = x , where f 4 denotes the fourth iteration of f . Note that f 4 ( x ) is a polynomial of degree 16, so the system has at most 16 real solutions.
Suppose that − 2 ≤ x 1 ≤ 2 . Then there exists an angle θ such that x 1 = − 2 cos θ . Also, $$x 2 = 2 - x 1^2 = 2 - 4 \cos^2 \theta = -2 (2 \cos^2 \theta - 1) = -2 \cos 2 \theta.$$ Similarly, x 3 = − 2 cos 4 θ , x 4 = − 2 cos 8 θ , and x 1 = − 2 cos 1 6 θ . Thus, we want θ to satisfy cos 1 6 θ = cos θ . From the sum-to-product formula, $$\sin \frac{15 \theta}{2} \sin \frac{17 \theta}{2} = 0.$$ Then θ = 1 5 2 k π or θ = 1 7 2 k π for some integer k . Checking which values lead to distinct values of x 1 , we obtain the following solutions for ( x 1 , x 2 , x 3 , x 4 ) : ( − 2 , − 2 , − 2 , − 2 ) , $$\left( -2 \cos \frac{2k \pi}{15}, -2 \cos \frac{4k \pi}{15}, -2 \cos \frac{8k \pi}{15}, -2 \cos \frac{16k \pi}{15} \right)$$ for 1 ≤ k ≤ 7 , and $$\left( -2 \cos \frac{2k \pi}{17}, -2 \cos \frac{4k \pi}{17}, -2 \cos \frac{8k \pi}{17}, -2 \cos \frac{16k \pi}{17} \right)$$ for 1 ≤ k ≤ 8 . This give us 1 + 7 + 8 = 1 6 distinct solutions, so these solutions are in fact all the real solutions to the given system. The important part of this argument is that the system does have 16 real solutions.
Next, we classify all 16 real solutions. It is possible that x 1 , x 2 , x 3 , and x 4 are all distinct. Otherwise, two of them are equal.
Suppose that two consecutive terms are equal, say x 1 and x 2 . From x 2 = f ( x 1 ) , we get f ( x 1 ) = x 1 . Hence, x 3 = f ( x 2 ) = f ( x 1 ) = x 1 , and x 4 = f ( x 3 ) = f ( x 1 ) = x 1 , so x 1 = x 2 = x 3 = x 4 . It is easy to check that the only solutions to f ( x ) = x are x = 1 and x = − 2 .
Now, suppose that two non-consecutive terms are equal, say x 1 and x 3 . Then x 4 = f ( x 3 ) = f ( x 1 ) = x 2 . Also, x 3 = f ( f ( x 1 ) ) , so x 1 is a root of the equation f ( f ( x ) ) = x , or $$2 - (2 - x^2)^2 = x.$$ This equation factors as $$(x - 1)(x + 2)(x^2 - x - 1) = 0.$$ This factorization should make sense, because any root of f ( x ) = x will also be a root of f ( f ( x ) ) = x . Moreover, the solutions x = 1 and x = − 2 lead to x 1 = x 2 . The roots of x 2 − x − 1 = 0 are $$x = \frac{1 \pm \sqrt{5}}{2}.$$
Thus, every solution to the given system falls under one of the following categories:
(1) x 1 , x 2 , x 3 , and x 4 are all distinct.
(2) x 1 = x 2 = x 3 = x 4 .
(3) x 1 = x 3 and x 2 = x 4 , and x 1 = x 2 .
There are two solutions in category (2) and two solutions in category (3), which leaves 1 6 − 2 − 2 = 1 2 solutions in category (1).
In this problem, we are looking for solutions where x 1 , x 2 , x 3 , and x 4 are all distinct (category (1)), and x 1 = min ( x 1 , x 2 , x 3 , x 4 ) . Because each variable depends only on the previous variable via the function f , any cyclic permutation of a solution gives another solution. There are 12 solutions in category (1), and in each such solution, all the x i are distinct, which means there is a unique cyclic permutation that leads to x 1 = min ( x 1 , x 2 , x 3 , x 4 ) . Therefore, the number of round sets is 1 2 / 4 = 3 .
Nicely done!
This solution is similar to Mark H.'s solution, but uses the degree argument instead of the inequalities and − 2 cos θ instead of 2 cos θ .
Problem Loading...
Note Loading...
Set Loading...
If ∣ x 1 ∣ > 2 then ∣ x 2 ∣ = ∣ 2 − x 1 2 ∣ > 2 ∣ x 1 ∣ − 2 > ∣ x 1 ∣ > 2 , and hence ∣ x 1 ∣ > ∣ x 4 ∣ > ∣ x 3 ∣ > ∣ x 2 ∣ > ∣ x 1 ∣ , which is not possible. Thus we deduce that ∣ x 1 ∣ ≤ 2 , so that we can write x 1 = 2 cos θ . But then x 2 x 3 x 4 = = = − 2 cos 2 θ = 2 cos ( 2 θ − π ) 2 cos ( 2 ( 2 θ − π ) − π ) = 2 cos ( 4 θ − π ) 2 cos ( 2 ( 4 θ − π ) − π ) = 2 cos ( 8 θ − π ) and so 2 cos θ cos 1 6 θ + cos θ 2 cos 2 1 7 θ cos 2 1 5 θ = = = 2 cos ( 2 ( 8 θ − π ) − π ) = − 2 cos 1 6 θ 0 0 Thus x 1 = 2 cos θ where either θ = 1 5 m π or θ = 1 7 m π for odd integers m . Distinct possible values of x 1 are then 2 cos 1 5 m π ( m = 1 , 3 , 5 , … 1 5 ) 2 cos 1 7 m π ( m = 1 , 3 , 5 , … , 1 7 ) We are told that the numbers x 1 , x 2 , x 3 , x 4 must be distinct. If any two of x 1 , x 2 , x 3 , x 4 are equal, then they are either all equal or else x 1 = x 3 and x 2 = x 4 . Either way we must have x 1 = x 3 , in which case 2 cos θ + 2 cos 4 θ = 4 cos 2 5 θ cos 2 3 θ = 0 so we must exclude values for x 1 of the form 2 cos 3 m π or 2 cos 5 m π for odd integers m . Thus we must exclude 2 cos 1 5 m π ( m = 3 , 5 , 9 , 1 5 ) 2 cos 1 7 m π ( m = 1 7 ) from the above list of possible values of x 1 .
Thus there are three possible sets {x 1,x 2,x 3,x 4}, namely { 2 cos 1 5 π , 2 cos 1 5 1 3 π , 2 cos 1 5 1 1 π , 2 cos 1 5 7 π } { 2 cos 1 7 π , 2 cos 1 7 1 5 π , 2 cos 1 7 1 3 π , 2 cos 1 7 9 π } { 2 cos 1 7 3 π , 2 cos 1 7 1 1 π , 2 cos 1 7 5 π , 2 cos 1 7 7 π } and each of these sets has a minimum element, which must be x 1 . The values of x 2 , x 3 , x 4 are then fixed. Thus there are 3 round sets.