ω ∈ W ∑ Li 2 ( ω x ) = n = 1 ∑ 2 0 1 5 a n Li 2 ( x n ) The equation above holds true where W is the set of the 2 0 1 5 th primitive roots of unity .
If the value of n = 1 ∑ 2 0 1 5 a n can be expressed as − B A , where A and B are coprime positive integers, find A + B .
Notation
:
Li
n
(
a
)
denotes the
polylogarithm
function,
Li
n
(
a
)
=
k
=
1
∑
∞
k
n
a
k
.
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.
Nice explanation! (+1) I did it in a similar way. It is worth pointing out that for a square-free k the answer comes out to be k 1 ∑ d ∣ k μ ( d ) d = k μ ( k ) ( i d ∗ μ ) ( k ) = k μ ( k ) ϕ ( k ) . For k = 2 0 1 5 this is − 4 0 3 2 8 8 .
Best problem I have ever seen .... nice solution , keep it up ...
Problem Loading...
Note Loading...
Set Loading...
COnsider O ( k ) = ω ∈ W k ∑ L i s ( ω x ) Where W k is the set of the kth primitive roots of unity. We easily remember that ω ∈ R k ∑ L i s ( ω x ) = k 1 − s L i s ( x k ) Where R k is the set of the kth root of unity (this one is easy to prove) Using the fact that every kth root of unity is a dth primitive root of unity for d|k, so we can write k 1 − s L i s ( x k ) = d ∣ k ∑ O ( d ) Using the möbius inversion we have O ( k ) = d ∣ k ∑ d 1 − s μ ( k / d ) L i s ( x d ) SO the sum of the coefficients will be d ∣ k ∑ d 1 − s μ ( k / d ) = p a ∣ k ∏ d ∣ p a ∑ d 1 − s μ ( p a / d ) = p a ∣ k ∏ ( p a ( 1 − s ) − p ( a − 1 ) ( 1 − s ) ) SO at k=2015 which is 2 0 1 5 = 5 ∗ 1 3 ∗ 3 1 and s=2 we have O ( 2 0 1 5 ) = ( 5 − 1 − 1 ) ( 1 3 − 1 − 1 ) ( 3 1 − 1 − 1 ) = − 4 0 3 2 8 8 and 2 8 8 + 4 0 3 = 6 9 1