MHB Number of Real Solutions to Cosine System Between 0 and 2π

  • Thread starter Thread starter eddybob123
  • Start date Start date
  • Tags Tags
    Cosine System
AI Thread Summary
The discussion focuses on finding the number of unordered sets of distinct real numbers {t_1, t_2, t_3, t_4} that satisfy a system of cosine equations. The equations are transformed using the cosine double angle identity, leading to a mapping of cosines represented as x_n = cos(t_n). The periodic nature of the mapping suggests that solutions can be derived from periodic points, specifically through the composition of the function f. The derived solution involves the values x = ±√(1/6), leading to the set {θ, π-θ, π+θ, 2π-θ} as a valid solution. The conclusion is that this appears to be the only unique solution to the problem.
eddybob123
Messages
177
Reaction score
0
How many (unordered) sets of pairwise distinct real numbers $$\{t_1,t_2,t_3,t_4\}$$ all between 0 and $$2\pi$$ are there such that in some order they satisfy the following system:
$$\begin{align*}\cos(2t_1)=4\cos(t_1)\cos(t_2)\\
\cos(2t_2)=4\cos(t_2)\cos(t_3)\\
\cos(2t_3)=4\cos(t_3)\cos(t_4)\\
\cos(2t_4)=4\cos(t_4)\cos(t_1)
\end{align*}$$
 
Mathematics news on Phys.org
eddybob123 said:
How many (unordered) sets of pairwise distinct real numbers $$\{t_1,t_2,t_3,t_4\}$$ all between 0 and $$2\pi$$ are there such that in some order they satisfy the following system:
$$\begin{align*}\cos(2t_1)=4\cos(t_1)\cos(t_2)\\
\cos(2t_2)=4\cos(t_2)\cos(t_3)\\
\cos(2t_3)=4\cos(t_3)\cos(t_4)\\
\cos(2t_4)=4\cos(t_4)\cos(t_1)
\end{align*}$$
Nobody else has tried this one, so I'll throw in my thoughts. First, I used the relation $\cos2\theta = 2\cos^2\theta-1$ to write the equations as $\cos t_{n+1} = \dfrac{2\cos^2t_n - 1}{4\cos t_n}\ (n=1,2,3,4)$ (where $t_5$ is interpreted to mean $t_1$). Next, let $x_n = \cos t_n$. Then $x_{n+1} = f(x_n)$, where $f(x) = \dfrac{2x^2-1}{4x}$. So $x_1$ is a periodic point of this mapping, with period $4$. There is also the requirement that $|x_n| \leqslant 1$ for each $n$.

So we want to find $x$ such that $f(f(f(f(x)))) = x$. The composition of four repetitions of the map $f$ seems impossibly complicated, and the best I can do is to form the composition of two repetitions of $f$. In fact, $$f(f(x)) = \frac{2\left(\frac{2x^2-1}{4x}\right)^2-1}{\frac{2x^2-1}{x}},$$ which simplifies to $\dfrac{4x^4 - 12x^2 + 1}{8x(2x^2-1)}.$ if you put that equal to $x$, you get the solutions $x = \pm\sqrt{1/6}$.

Now let $\theta = \arccos\sqrt{1/6}$. Then you can get a solution to the original problem by taking $\{t_1,t_2,t_3,t_4\} = \{\theta, \pi-\theta, \pi+\theta, 2\pi-\theta\}$ (as an unordered set). The trick there is to expand the orbit of period two in the $x$-map to an orbit of period four in the $t$-space by using the fact that there are two numbers in the interval $[0,2\pi]$ taking any given value of the cosine function. In that way, we get four distinct values for the $t_n$ although there are only two distinct values of the $x$'s.

That is the only solution that I can find to this problem, and my guess is that it is unique.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top