Let
be a
primitive
root of unity, and
let
be a primitive
root of unity.
Then
is a primitive
root of unity for some positive integer
What can we say about in general?
Clarification:
In the answer choices,
and
denote the
greatest common divisor
function and the
lowest common multiple
function, respectively.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Relevant wiki: Primitive Roots of Unity
Let ζ m = e m 2 π k 1 i , ζ n = e n 2 π k 2 i , ζ l = e l 2 π k 3 i
As per conditions we have ζ m ζ n = ζ l ⟹ m k 1 + n k 2 = l k 3 .
Moreover Since it's a primitive root of unity , We have ( k 1 , m ) = ( k 2 , n ) = ( k 3 , l ) = 1 where k 1 ∈ [ 1 , m ] , k 2 ∈ [ 1 , n ] , k 3 ∈ [ 1 , l ]
Case 1: Suppose l = g c d ( m , n ) ⟹ g c d ( l m , l n = 1 ) , ( k 1 , m ) = 1 ⟹ ( k 1 , l m ) = 1 . Similarly ( k 2 , l n ) = 1 .
So l m k 1 + l n k 2 = k 3 , RHS is an integer but LHS is irreducible since ( k 1 , l m ) = 1 , ( k 2 , l n ) = 1 . Case Dismissed
Case 2: Suppose l = m n . So we have the following facts :
⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ ( k 3 , l ) = 1 ( k 3 , m n ) = 1 ( k 3 , m ) = 1 ( k 3 , n ) = 1
Putting l = m n we get , k 3 k 1 n + k 3 k 2 m = 1 . So k 3 ∣ k 1 , k 2 which is a special requirement for this identity to be satisfied and not always true. So Case Dismissed
Case 3 : Suppose l = l c m ( m , n ) , l = m x = n y with ( x , y ) = 1 , ( k 3 , m x ) = ( k 3 , n y ) = 1 ⟹ ( k 3 , m ) = ( k 3 , x ) = ( k 3 , n ) = ( k 3 , y ) = 1 . So we get putting m = x l , n = y l ,
k 1 x + k 2 y = k 3 ⟹ k 1 k 3 x + k 2 k 3 y = 1 . Again since RHS is an integer we must have LHS integer.
So, k 3 ∣ k 1 , k 2 which is the requirement for l = l c m ( m , n ) to be true. So in general we can't say this is always true. Case Dismissed
So none of the options fit so we have, None Of These