Find
S = ∑ ω 1 7 2 9 ,
where the sum is taken over all primitive 2 0 1 5 th roots of unity ω .
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.
Great usage of the Mobius Inversion to deal with this problem.
nice solution(+1). this is how the sum of the primitive roots of unity turned out to be möbius function! i was approaching in a similar way but made some errors....
Prime decomposition of 2 0 1 5 = 5 × 1 3 × 3 1 and 1 7 2 9 = 7 × 1 3 × 1 9
Let ζ q = e q 2 π i
We can write w a primitive root uniquely as (from C 2 0 1 5 and C 5 × C 1 3 × C 3 1 isomorphism) w = ζ 5 a ζ 1 3 b ζ 3 1 c f o r 1 ≤ a ≤ 4 1 ≤ b ≤ 1 2 1 ≤ c ≤ 3 0
Then
S
=
∑
w
1
7
2
9
=
(
1
≤
a
≤
4
∑
ζ
5
1
7
2
9
a
)
(
1
≤
b
≤
1
2
∑
ζ
1
3
1
7
2
9
b
)
(
1
≤
c
≤
3
0
∑
ζ
3
1
1
7
2
9
c
)
Let η q ( n ) = ∑ k = 1 q − 1 ζ q k n
Then: S = η 5 ( 1 7 2 9 ) × η 1 3 ( 1 7 2 9 ) × η 3 1 ( 1 7 2 9 ) )
It follows from the identity x q − 1 = ( x − 1 ) ( x q − 1 + x q − 2 + . . . + x + 1 ) that for q prime
η q ( n ) = { − 1 q − 1 if q ∤ n if q ∣ n
S = − 1 × 1 2 × − 1 = 1 2
Yes, very nice! (+1) You had some "fun in 2015" just before the expiration date ;)
Problem Loading...
Note Loading...
Set Loading...
Abdelhamid has submitted a fine solution. For the sake of variety, let me show a slightly different approach.
Let c m ( n ) be the sum of all the n th powers of the primitive m th roots of unity. Let b m ( n ) be the sum of the n th powers of all m th roots of unity. We know that b m ( n ) = m if m ∣ n and b m ( n ) = 0 otherwise. Since every m th root of unity is a primitive d th root of unity for some divisor d of m , we find that b m ( n ) = ∑ d ∣ m c d ( n ) . Mobius inversion gives c m ( n ) = d ∣ m ∑ b d ( n ) μ ( m / d ) = d ∣ g cd ( m , n ) ∑ d × μ ( m / d )
In particular, since g cd ( 2 0 1 5 , 1 7 2 9 ) = 1 3 , we have c 2 0 1 5 ( 1 7 2 9 ) = ∑ d ∣ 1 3 d × μ ( 2 0 1 5 / d ) = − 1 + 1 3 = 1 2