De Movire's Theorem: Applications for Root Extraction

  • Context: Undergrad 
  • Thread starter Thread starter revitgaur
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary
SUMMARY

De Moivre's Theorem is essential for finding the n distinct roots of a complex number, expressed as ##z = p(cos\theta + isin\theta)##. The theorem states that if ##z^{n} = w##, then the n-th roots can be calculated using the formula ##z = \sqrt[\leftroot{-2}\uproot{2}n]{r} [cos \frac{\phi + 2\pi k}{n} + isin \frac{\phi + 2\pi k}{n}]##, where ##k = 0, 1, 2, \cdots, n - 1##. This allows for the computation of roots such as the 4-th root of a complex number. The periodic nature of sine and cosine functions plays a crucial role in determining these roots.

PREREQUISITES
  • Understanding of complex numbers and their polar representation
  • Familiarity with trigonometric functions, specifically sine and cosine
  • Knowledge of exponentiation and roots in mathematics
  • Basic grasp of periodic functions and their properties
NEXT STEPS
  • Study the derivation and proof of De Moivre's Theorem
  • Learn about the geometric interpretation of complex roots
  • Explore applications of complex numbers in engineering and physics
  • Investigate numerical methods for computing complex roots
USEFUL FOR

Mathematicians, engineering students, and anyone interested in complex analysis and its applications in various fields such as physics and electrical engineering.

revitgaur
Messages
3
Reaction score
1
I want to know about applications of De Movire's theorem for root extraction.
 
Mathematics news on Phys.org
Perhaps the greatest value of De Moivre's Theorem, is the ability to find the n distinct roots of a complex number.

Let ##z = p(cos\theta + isin\theta)## and let ##z^{n} = w##. Then if ##w = r(cos\phi+ isin\phi)##, ##z^{n} = [p(cos\theta + isin\theta)]^{n}## we have
that ##p^{n}[cos(n\theta) +isin(n\theta)] = r(cos\phi+ isin\phi)##. That implies that ##p^{n} = r## and ##n\theta = \phi##, or equivalently ##p =
\sqrt[\leftroot{-2}\uproot{2}n]{r}## and ##\theta = \frac{\phi}{n}##. But ##sin## and ##cos## have period of ##2\pi## so ##n\theta = \phi + 2\pi k## or equivalently ##\theta = \frac{\phi + 2\pi k}{n}##, ##k = 0, 1, 2, \cdots, n - 1##. If we set ##k = n## the solutions are repeated . So, for a positive integer ##n##, we find ##n## distinct ##n-th## roots for the complex number ##w = r(cos\phi+ isin\phi)## : ##z = \sqrt[\leftroot{-2}\uproot{2}n]{r} [cos \frac{\phi + 2\pi k}{n} + isin \frac{\phi + 2\pi k}{n}]##.

With the help of the above formula, we can compute the ##n- th## roots of e.g ##1## or maybe some specific roots, e.g ##4 - th##.
 
Last edited:
  • Like
Likes   Reactions: revitgaur
QuantumQuest said:
Perhaps the greatest value of De Moivre's Theorem is the ability to find the n distinct roots of a complex number.

Let ##z = p(cos\theta + isin\theta)## and let ##z^{n} = w##. Then if ##w = r(cos\phi+ isin\phi)##, ##z^{n} = [p(cos\theta + isin\theta)]^{n}## we have
that ##p^{n}[cos(n\theta) +isin(n\theta)] = r(cos\phi+ isin\phi)##. That implies that ##p^{n} = r## and ##n\theta = \phi##, or equivalently ##p =
\sqrt[\leftroot{-2}\uproot{2}n]{r}## and ##\theta = \frac{\phi}{n}##. But ##sin## and ##cos## have period of ##2\pi## so ##n\theta = \phi + 2\pi k## or equivalently ##\theta = \frac{\phi + 2\pi k}{n}##, ##k = 0, 1, 2, \cdots, n - 1##. If we set ##k = n## the solutions are repeated . So, for a positive integer ##n##, we find ##n## distinct ##n-th## roots for the complex number ##w = r(cos\phi+ isin\phi)## : ##z = \sqrt[\leftroot{-2}\uproot{2}n]{r} [cos \frac{\phi + 2\pi k}{n} + isin \frac{\phi + 2\pi k}{n}]##.

With the help of the above formula we can compute the ##n- th## roots of e,g ##1## or maybe some specific roots e.g ##4 - th##.
Thanks for helping me
 
  • Like
Likes   Reactions: QuantumQuest

Similar threads

  • · Replies 38 ·
2
Replies
38
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 105 ·
4
Replies
105
Views
11K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K