Chapter 5: Problem 5
Solve the equation $$ \cos x+\cos 2 x-\cos 3 x=1 $$
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 5: Problem 5
Solve the equation $$ \cos x+\cos 2 x-\cos 3 x=1 $$
All the tools & learning materials you need for study success - in one app.
Get started for free
A triangle \(A_{1} A_{2} A_{3}\) and a point \(P_{0}\) are given in the plane. We define \(A_{s}=A_{s-3}\) for all \(s \geq 4 .\) We construct a sequence of points \(P_{0}, P_{1}, P_{2}, \ldots\) such that \(P_{k+1}\) is the image of \(P_{k}\) under the rotation with center \(A_{k+1}\) through the angle \(120^{\circ}\) clockwise \((k=0,1,2, \ldots) .\) Prove that if \(P_{1986}=P_{0}\), then the triangle \(A_{1} A_{2} A_{3}\) is equilateral.
Let \(n\) be an odd positive integer and \(\varepsilon_{0}, \varepsilon_{1}, \ldots, \varepsilon_{n-1}\) the complex roots of unity of order \(n .\) Prove that $$ \prod_{k=0}^{n-1}\left(a+b \varepsilon_{k}^{2}\right)=a^{n}+b^{n} $$ for all complex numbers a and \(b\).
Let \(A, B, C\) be three consecutive vertices of a regular \(n\) -gon and consider the point \(M\) on the circumcircle such that points \(B\) and \(M\) lie on opposite sides of the line \(A C\). Prove that \(M A+M C=2 M B \cos \frac{\pi}{n}\)
Let \(n \geq 3\) be an integer and \(z=\cos \frac{2 \pi}{n}+i \sin \frac{2 \pi}{n} .\) Consider the sets $$ A=\left\\{1, z, z^{2}, \ldots, z^{n-1}\right\\} $$ and $$ B=\left\\{1,1+z, 1+z+z^{2}, \ldots, 1+z+\ldots+z^{n-1}\right\\} . $$ Determine \(A \cap B\).
Consider a complex number \(z, z \neq 0\), and the real sequence $$ a_{n}=\left|z^{n}+\frac{1}{z^{n}}\right|, n \geq 1 . $$ (a) Show that if \(a_{1}>2\), then $$ a_{n+1}<\frac{a_{n}+a_{n+2}}{2}, \text { for all } n \in \mathbb{N}^{*} \text { . } $$ (b) Prove that if there exists \(k \in \mathbb{N}^{*}\) such that \(a_{k} \leq 2\), then \(a_{1} \leq 2\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.