Using complex exponentials to prove 1+acostheta

  • Thread starter Thread starter captainemeric
  • Start date Start date
  • Tags Tags
    Complex
captainemeric
Messages
8
Reaction score
0

Homework Statement


Use complex exponentials to prove 1 + acos(theta) + a^2cos(2theta) + a^3cos(3theta)... = (1 - acos(theta))/(1 - 2acos(theta) + a^2)


Homework Equations



euler's e^itheta/2 +e^-itheta/2=2cos(2theta)

The Attempt at a Solution



a^(n)cos(ntheta) = e^nitheta = e^-nitheta

from there i got the series

(a^n(e^itheta)^n)/2

now from here I think I setup the summation formula but this is where I get stuck. Any help is greatly apprecited.
 
Physics news on Phys.org
Is |a| < 1?
 
Yes, a is a real constant and |a| < 1. sorry about that
 
<br /> a^n \cos n\theta = a^n\frac {e^{in\theta} + e^{-in\theta}} {2}<br /> = \frac {a^ne^{in\theta} + a^ne^{-in\theta}} {2}<br /> = \frac {p^n + q^n} {2}<br /> \\ p = (\ln a)e^{i\theta}, \ |p| &lt; 1<br /> \\ q = (\ln a)e^{-i\theta}, \ |q| &lt; 1<br />

What is the sum of p^n and q^n?
 
That makes sense. That will then give me a real and an imaginary result of which I take the real I believe. Also, I apologize for the typo on the first post.
 
Well, you can take the real part, but the sum is real anyway.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top