We define a carousel to be a (unordered) set of four pairwise distinct real numbers { t 1 , t 2 , t 3 , t 4 } , all strictly between 0 and 2 π , such that in some order they satisfy the following system of equations
⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ cos ( 2 t 1 ) = 4 cos t 1 cos t 2 cos ( 2 t 2 ) = 4 cos t 2 cos t 3 cos ( 2 t 3 ) = 4 cos t 3 cos t 4 cos ( 2 t 4 ) = 4 cos t 4 cos t 1 .
How many carousels are there?
Details and assumptions
A set is unordered. If a set satisfies the above system for several different orderings, it is only counted once.
A set of values is called pairwise distinct if no two of them are equal. For example, the set { 1 , 2 , 2 } is not pairwise distinct, because the last two values are the same.
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.
An excellent and very detailed solution of a tricky problem!
Let u j = cos t j for 1 ≤ j ≤ 4 . Then − 1 ≤ u j < 1 for all j , and 2 u 1 2 − 1 = 4 u 1 u 2 2 u 3 2 − 1 = 4 u 3 u 4 2 u 2 2 − 1 = 4 u 2 u 3 2 u 4 2 − 1 = 4 u 4 u 1 Thus u j = 0 for all j , and u 2 = f ( u 1 ) u 3 = f ( u 2 ) u 4 = f ( u 3 ) u 1 = f ( u 4 ) where f is the function f ( x ) = 4 x 2 x 2 − 1 and hence, composing f with itself f f f f ( u j ) = u j 1 ≤ j ≤ 4 Now f f f f ( x ) − x is the rational function with numerator 1 − 2 0 8 x 2 + 5 0 4 0 x 4 − 2 9 1 2 0 x 6 + 2 2 8 8 0 x 8 + 1 0 9 8 2 4 x 1 0 − 1 6 3 0 7 2 x 1 2 + 5 6 3 2 0 x 1 4 − 3 8 4 0 x 1 6 and denominator 3 2 x ( − 1 + 2 x 2 ) ( 1 − 1 2 x 2 + 4 x 4 ) × ( 1 − 5 6 x 2 + 2 8 0 x 4 − 2 2 4 x 6 + 1 6 x 8 ) The numerator factorises as − ( 1 + 2 x 2 ) ( − 1 + 6 x 2 ) ( 1 − 2 0 x 2 + 2 0 x 4 ) × ( 1 − 1 8 4 x 2 + 5 3 6 x 4 − 2 2 4 x 6 + 1 6 x 8 ) so we deduce that u 1 , u 2 , u 3 , u 4 satisfy h ( x ) = 0 , where h ( x ) is the polynomial ( 6 x 2 − 1 ) ( 1 − 2 0 x 2 + 2 0 x 4 ) ( 1 − 1 8 4 x 2 + 5 3 6 x 4 − 2 2 4 x 6 + 1 6 x 8 ) Thus the only possible values of u 1 , u 2 , u 3 , u 4 are ± α , ± β 1 , ± β 2 , ± γ 1 , ± γ 2 , ± γ 3 , ± γ 4 , where α = 6 1 β 1 = 1 0 5 + 2 5 γ 1 = 2 7 − 5 − 3 ( 5 − 2 5 ) γ 3 = 2 7 + 5 − 3 ( 5 + 2 5 ) β 2 = 1 0 5 − 2 5 γ 2 = 2 7 − 5 + 3 ( 5 − 2 5 ) γ 4 = 2 7 + 5 + 3 ( 5 + 2 5 ) But f ( γ 1 ) = − γ 4 f ( γ 2 ) = γ 3 f ( γ 3 ) = − γ 1 f ( γ 4 ) = γ 2 and so the only possible candidates for u -translates of carousels involving the γ terms are cyclic permutations of γ 1 , − γ 4 , − γ 2 , − γ 3 and − γ 1 , γ 4 , γ 2 , γ 3 Since γ 2 , γ 4 > 1 , we deduce that none of ± γ 1 , ± γ 2 , ± γ 3 , ± γ 4 can occur in a u -translate of a carousel. Thus the only possible values of u 1 , u 2 , u 3 , u 4 are ± α , ± β 1 , ± β 2 , and since f ( ± α ) = ∓ α f ( ± β 1 ) = ± β 2 f ( ± β 2 ) = ∓ β 1 the only possible values of u 1 , u 2 , u 3 , u 4 are α , − α , α , − α or β 1 , β 2 , − β 1 , − β 2 or some cyclic permutation of one of these.
We need to convert these two u -translates back into the possible carousels. For any 0 < ∣ u ∣ < 1 there are exactly 2 values of t between 0 and 2 π such that cos t = u .
Since the four numbers in a carousel need to be distinct, there is exactly one carousel which leads to the u -translate α , − α , α , − α , and that is { cos − 1 α , π − cos − 1 α , 2 π − cos − 1 α , π + cos − 1 α } .
To get the u -translate β 1 , β 2 , − β 1 , − β 2 , we need to choose one out of cos − 1 β 1 and 2 π − cos − 1 β 1 , one out of cos − 1 β 2 and 2 π − cos − 1 β 2 , one out of π − cos − 1 β 1 and π + cos − 1 β 1 , and one out of π − cos − 1 β 2 and π + cos − 1 β 2 . Since the eight numbers we are choosing between are all distinct, we can make all four of these choices freely and always obtain four distinct numbers, and hence there are 1 6 different carousels which lead to the u -translate β 1 , β 2 , − β 1 , − β 2 .
Thus there are 1 7 carousels in total.
Brilliant! This is not the easiest way to do it, but is quite original.
Problem Loading...
Note Loading...
Set Loading...
For 1 ≤ i ≤ 4 , let x i = cos t i . Then the given equations become 2 x i 2 − 1 = 4 x i x i + 1 , where the indices are taken modulo 4. Solving for x i + 1 , we get x i + 1 = 4 x i 2 x i 2 − 1 .
Let y i = x i 2 1 , so x i = y i 2 1 . Substituting, we get y i + 1 2 1 = 4 ⋅ y i 2 1 2 ( y i 2 1 ) 2 − 1 , which simplifies to y i + 1 = 1 − y i 2 2 y i .
Finally, let y 1 = tan θ , where 0 ∘ ≤ θ < 1 8 0 ∘ . Then
y 2 y 3 y 4 y 1 = 1 − y 1 2 2 y 1 = 1 − tan 2 θ 2 tan θ = tan 2 θ , = 1 − y 2 2 2 y 2 = 1 − tan 2 2 θ 2 tan 2 θ = tan 4 θ , = 1 − y 3 2 2 y 3 = 1 − tan 2 4 θ 2 tan 4 θ = tan 8 θ , = 1 − y 4 2 2 y 4 = 1 − tan 2 8 θ 2 tan 8 θ = tan 1 6 θ .
Hence, tan θ = tan 1 6 θ . The tan function has period 1 8 0 ∘ , so 1 5 θ = ( 1 8 0 n ) ∘ for some integer n , 0 ≤ n ≤ 1 4 , or θ = ( 1 2 n ) ∘ . Then ( x 1 , x 2 , x 3 , x 4 ) is of the form ( 2 ⋅ tan ( 1 2 n ) ∘ 1 , 2 ⋅ tan ( 2 4 n ) ∘ 1 , 2 ⋅ tan ( 4 8 n ) ∘ 1 , 2 ⋅ tan ( 9 6 n ) ∘ 1 ) .
Using the identity tan θ 1 = tan ( 9 0 ∘ − θ ) , it is easy to check that up to cyclic permutation, all these solutions are equal to one of the following:
( 2 1 tan 3 0 ∘ , − 2 1 tan 3 0 ∘ , 2 1 tan 3 0 ∘ , − 2 1 tan 3 0 ∘ ) , ( 1 ) ( 2 1 tan 1 8 ∘ , − 2 1 tan 5 4 ∘ , − 2 1 tan 1 8 ∘ , 2 1 tan 5 4 ∘ ) , ( 2 ) ( 2 1 tan 6 ∘ , − 2 1 tan 7 8 ∘ , − 2 1 tan 6 6 ∘ , − 2 1 tan 4 2 ∘ ) , ( 3 ) ( − 2 1 tan 6 ∘ , 2 1 tan 7 8 ∘ , 2 1 tan 6 6 ∘ , 2 1 tan 4 2 ∘ ) . ( 4 )
Because x i = cos t i , each element of a viable solution must be at most 1 in absolute value. Since 2 1 tan 6 6 ∘ > 2 1 tan 6 0 ∘ = 2 1 ⋅ 3 > 1 , this rules out solutions (3) and (4).
On the other hand, tan 5 4 ∘ = 1 0 − 2 5 1 + 5 , and
2 1 ⋅ 1 0 − 2 5 1 + 5 ⇔ 1 + 5 ⇔ ( 1 + 5 ) 2 ⇔ 6 + 2 5 ⇔ 6 5 ⇔ 3 5 ⇔ ( 3 5 ) 2 ⇔ 4 5 < 1 < 2 5 − 5 < ( 2 5 − 5 ) 2 < 2 0 − 4 5 < 1 4 < 7 < 7 2 < 4 9 ,
which is true, so solutions (1) and (2) are viable.
The last step is to determine how many carousels can be made from solutions (1) and (2).
In solution (1), note that x 1 = x 3 and x 2 = x 4 . But all the t i must be distinct, so there is exactly one carousel that corresponds to solution (1), which is as follows: Let α = arccos ( 2 1 tan 3 0 ∘ ) = arccos ( 6 1 ) . Then 0 < α < 1 8 0 ∘ and cos ( 1 8 0 ∘ − α ) = − cos α = − 6 1 , so ( α , 1 8 0 ∘ − α , 3 6 0 ∘ − α , α + 1 8 0 ∘ ) is a carousel.
In solution (2), all the x i are distinct. This means for each i , there are two choices for t i , namey t i = arccos x i and t i = 3 6 0 ∘ − arccos x i . So there are 2 4 = 1 6 carousels that correspond to solution (2).
This gives us a total of 1 + 1 6 = 1 7 carousels.