Rotating two different complex numbers

Click For Summary
SUMMARY

This discussion centers on the behavior of complex numbers under exponentiation, specifically examining the arguments of two complex numbers, a and b. The user Daniel proposes that there exists a positive integer n such that the arguments of a^n and b^n fall within specified ranges. However, it is established that this is not universally true, particularly when both complex numbers have rational arguments, leading to a finite number of integer power images. The discussion concludes that the condition for the arguments to be in different halves is necessary but not sufficient for the proposed statement to hold.

PREREQUISITES
  • Understanding of complex numbers and their arguments
  • Familiarity with exponentiation of complex numbers
  • Knowledge of rational numbers and their properties
  • Basic concepts of modular arithmetic, specifically modulo 2π
NEXT STEPS
  • Study the properties of complex number arguments in detail
  • Explore the implications of rational arguments in complex exponentiation
  • Investigate the concept of modular arithmetic in the context of complex numbers
  • Learn about the geometric interpretation of complex exponentiation
USEFUL FOR

Mathematicians, students studying complex analysis, and anyone interested in the properties of complex numbers and their applications in various fields.

daniel_i_l
Gold Member
Messages
864
Reaction score
0
Let's say that I have two complex numbers, a and b, with different arguments. From a few "experiments" with a computer, I think that there always exists a positive integer n such that -pi/2 <= Arg(a^n) <= pi/2 and pi/2 <= Arg(b^n) <= 3pi/2.
In other words, if Arg(a) = thetaA and Arg(b) = thetaB, then there exists an n such that
-pi/2 <= n*thetaA <= pi/2 and pi/2 <= n*thetaB <= 3pi/2 up to a multiple of 2pi.
Is this true? If so, how can I start to prove it?
Thanks,
Daniel
 
Physics news on Phys.org
It's not true for a = -1 and b = 1. In general, if both a and b have rational arguments they will only have a finite number of integer power images so it seems likely that you may find a whole range of argument pairs for which your condition will never be satisfied.
 
Do you just need them to be in different halves? In other words, is it sufficient that
[tex] |\textrm{arg}(a^n)-\textrm{arg}(b^n)| = n\cdot |\textrm{arg}(a)-\textrm{arg}(b)| \geq \pi [/tex]
-modulo [itex]2\pi[/itex] of course?

As Flip Larsen commented, you can't necessarily pick which is in which half...the above is definitely true, though. The proof is pretty much immediate.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 13 ·
Replies
13
Views
6K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
5K
  • · Replies 5 ·
Replies
5
Views
4K