Polylog of primitive root of unity

Calculus Level 5

ω W Li 2 ( ω x ) = n = 1 2015 a n Li 2 ( x n ) \large \sum_{\omega\in W} \text{Li}_2(\omega x) = \sum_{n=1}^{2015} a_n \text{Li}_2(x^n) The equation above holds true where W W is the set of the 201 5 th 2015^\text{th} primitive roots of unity .

If the value of n = 1 2015 a n \displaystyle \sum_{n=1}^{2015} a_n can be expressed as A B -\dfrac AB , where A A and B B are coprime positive integers, find A + B A+B .

Notation :
Li n ( a ) { \text{Li} }_{ n }(a) denotes the polylogarithm function, Li n ( a ) = k = 1 a k k n . { \text{Li} }_{ n }(a)=\displaystyle\sum _{ k=1 }^{ \infty }{ \frac { { a }^{ k } }{ { k }^{ n } } }.


The answer is 691.

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.

1 solution

Aareyan Manzoor
Apr 5, 2016

COnsider O ( k ) = ω W k L i s ( ω x ) O(k)=\sum_{\omega\in W_k} Li_s(\omega x) Where W k 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 ) \sum_{\omega\in R_k} Li_s (\omega x) = k^{1-s} Li_s(x^k) Where R k 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 ) k^{1-s} Li_s(x^k)=\sum_{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 ) O(k)=\sum_{d|k} d^{1-s} \mu(k/d) Li_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 ) ) \sum_{d|k} d^{1-s} \mu(k/d) = \prod_{p^a|k} \sum_{d|p^a} d^{1-s} \mu(p^a/d)=\prod_{p^a|k} (p^{a(1-s)} -p^{(a-1)(1-s)}) SO at k=2015 which is 2015 = 5 13 31 2015=5*13*31 and s=2 we have O ( 2015 ) = ( 5 1 1 ) ( 1 3 1 1 ) ( 3 1 1 1 ) = 288 403 O(2015)= (5^{-1}-1)(13^{-1}-1)(31^{-1}-1)=-\dfrac{288}{403} and 288 + 403 = 691 288+403=\boxed{691}

Nice explanation! (+1) I did it in a similar way. It is worth pointing out that for a square-free k k the answer comes out to be 1 k d k μ ( d ) d = μ ( k ) k ( i d μ ) ( k ) = μ ( k ) ϕ ( k ) k \frac{1}{k}\sum_{d|k} \mu(d)d=\frac{\mu(k)}{k}(id*\mu)(k)=\frac{\mu(k)\phi(k)}{k} . For k = 2015 k=2015 this is 288 403 -\frac{288}{403} .

Otto Bretscher - 5 years, 2 months ago

Best problem I have ever seen .... nice solution , keep it up ...

A Former Brilliant Member - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...