Hello, Maverick848!
I am having trouble understanding the solution to the following problem:
Find the number of ordered pairs of real numbers \(\displaystyle (a,b)\) such that \(\displaystyle \,(a\,+\,bi)^{2002}\:=\:a\,-\,bi\)
Multiply both sides by \(\displaystyle a\,+\,bi:\;\;(a\,+\,bi)^{2003}\:=\
a\,-\,bi)(a\,+\,bi)\;=\:a^2\,+\,b^2\)
Then \(\displaystyle \,a\,+\,bi\;=\;\) the two thousand three \(\displaystyle 2003^{rd}\) roots of \(\displaystyle a^2\,+\,b^2\).
Therefore, there are 2003 solutions.
How do you know that \(\displaystyle \,z^{2003}\:=\:1\) has 2003 solutions?
We have: \(\displaystyle \:z\;=\;(1)^{\frac{1}{2003}}\)
\(\displaystyle \;\;\)And every number has two square roots, three cube roots, four fourth roots, etc.
Another reason: an established theorem.
\(\displaystyle \;\;\text{Every polynomial equation of degree }n\text{ has }n\text{ solutions.}\)