Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "User:Wsjradha/Cotangent Sum Problem"

(New page: '''Cotangent Sum Problem''' AIME-level of difficulty Problem: Let <math>z_1, z_2, \ldots, z_{20}</math> be the twenty (complex) roots of the equation: <math>z^{20} - 4z^{19} + 9z^{18...)
 
m (minor LaTex and spacing)
Line 26: Line 26:
  
 
Also, <math>c(k_n)</math> will be the sum of the cotangent inverses of the roots, taken <math>n</math> at a time.  The cotangent inverses will be multiplied as necessary, then added.
 
Also, <math>c(k_n)</math> will be the sum of the cotangent inverses of the roots, taken <math>n</math> at a time.  The cotangent inverses will be multiplied as necessary, then added.
 +
 
Also, <math>tc(k_n)</math> will be the sum of the tangents of the cotangent inverses of the roots, taken <math>n</math> at a time.  Basically, this is the same as <math>c(k_n)</math> except that the tangents are taken right after the cotangent inverses.
 
Also, <math>tc(k_n)</math> will be the sum of the tangents of the cotangent inverses of the roots, taken <math>n</math> at a time.  Basically, this is the same as <math>c(k_n)</math> except that the tangents are taken right after the cotangent inverses.
 
For example,
 
For example,

Revision as of 15:24, 14 November 2008

Cotangent Sum Problem

AIME-level of difficulty


Problem:

Let $z_1, z_2, \ldots, z_{20}$ be the twenty (complex) roots of the equation:

$z^{20} - 4z^{19} + 9z^{18} - 16z^{17} + \cdots + 441 = 0$

Calculate the value of:

$\cot{\left(\sum_{k = 1}^{20} \cot^{ - 1}{z_k}\right)}$


Solution:

For the purpose of this solution $k_n$ will be the sum of the roots of the 20th degree polynomial, taken $n$ at a time. For example,

$k_1 = z_1 + z_2 + \cdots + z_{20}$

$k_2 = z_1z_2 + z_1z_3 + \cdots + z_{19}z_{20}$

Also, $c(k_n)$ will be the sum of the cotangent inverses of the roots, taken $n$ at a time. The cotangent inverses will be multiplied as necessary, then added.

Also, $tc(k_n)$ will be the sum of the tangents of the cotangent inverses of the roots, taken $n$ at a time. Basically, this is the same as $c(k_n)$ except that the tangents are taken right after the cotangent inverses. For example,

$tc(k_1) = tan(cot^{ - 1}{z_1}) + tan(cot^{ - 1}{z_2}) + \cdots + tan(cot^{ - 1}{z_{20}})$

Let $S = \cot{\left(\sum_{k = 1}^{20} \cot^{ - 1}{z_k}\right)}$ This equals $cot (c(k_1))$ There is a formula that states the following, where, for the purposes of this formula only, $\sum_{a_1}^n(b_m)$, is the sum of $a_1$ through $a_n$, taken $m$ at a time, in the fashion described above:

$tan{\left(a_1+a_2+a_3+\cdots+a_n\right)}=\dfrac{1-\sum_{a_1}^n(b_2)+\sum_{a_1}^n(b_4)-\sum_{a_1}^n(b_6)+\cdots}{\sum_{a_1}^n(b_1)-\sum_{a_1}^n(b_3)+\sum_{a_1}^n(b_5)-\cdots}$

When applied to this problem, it yields:

$tc(k_1) = \dfrac{1 - tc(k_2) + tc(k_4) + \cdots + tc(k_{20})}{tc(k_1) + tc(k_3) + \cdots + tc(k_{19})}$

Taking the reciprocal of either side, one gets:

$S = \dfrac{tc(k_1) + tc(k_3) + \cdots + tc(k_{19})}{1 - tc(k_2) + tc(k_4) + \cdots + tc(k_{20})}$

Multiple the numerator and the denominator of the right hand side by $tc(k_{20})$.

$S = \dfrac{k_{20} - k_{18} + k_{16} - k_{14} + k_{12} - k_{10} + k_8 - k_6 + k_4 - k_2 + 1}{k_{19} - k_{17} + k_{15} - k_{13} + k_{11} - k_9 + k_7 - k_5 + k_3 - k_1}$

$k_n$ can be determined, from the original 20th degree equation using Vieta's Formulas, to be $(n+1)^2$ Therefore,

$S = \dfrac{21^2 - 19^2 + 17^2 - 15^2 + \cdots - 3^2 + 1}{20^2 - 18^2 + \cdots - 2^2}$

This simplifies to $\boxed{\dfrac{241}{220}}$

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User:Wsjradha/Cotangent_Sum_Problem&oldid=28382"