Understanding Mathematics: playing with Dirichlet series

The best way to understand mathematics is to do mathematics. In keeping with this principle, this week's discussion offers you a series of questions and problems that further develop the ideas presented in this blog post. If you'd like to discuss your ideas and solutions with your Brilliant fellows, please post them below. I will also comment on them wherever appropriate.

  1. Calculate n=1τ(n)n4\sum_{n=1}^\infty \frac{\tau(n)}{n^4}, where τ(n)\tau(n) is the number of positive integer divisors of nn.

  2. Does the series n=1(1)n1τ(n)n\sum_{n=1}^\infty \frac{(-1)^{n-1}\,\tau(n)}{n} converge? If so, what is its sum?

  3. Compute n=1τ(2n+1)(2n+1)2\sum_{n=1}^\infty \frac{\tau(2n+1)}{(2n+1)^2}.

  4. For an integer n1n\geq 1, let τ2(n)\tau_2(n) denote the number of all odd positive integer divisors of nn. Find the sum n=1τ2(n)n2\sum_{n=1}^\infty \frac{\tau_2(n)}{n^2}.

  5. Does the series n=1τ2(n)n\sum_{n=1}^\infty \frac{\tau_2(n)}{n} converge?

  6. For an integer n1n\geq 1, let's define s(n)=1s(n)=1 if nn is divisible by 33 and s(n)=1s(n)=-1 otherwise. Does the series n=1s(n)n\sum_{n=1}^\infty \frac{s(n)}{n} converge? If so, what is the sum?

  7. Same question for the series n=1s(n)n2\sum_{n=1}^\infty\frac{s(n)}{n^2}.

  8. Prove that the series n=0(1)nτ(2n+1)(2n+1)s \sum_{n=0}^\infty \frac{(-1)^n \, \tau(2n+1)}{(2n+1)^s} converges conditionally (but not absolutely) for any real number s>12s>\frac{1}{2}, and converges absolutely for any s>1s>1.

  9. Investigate the convergence of the last series for s12s\leq \frac{1}{2}.

  10. Prove the following analogue of Dirichlet's asymptotic formula: as NN\to\infty k=0N1τ(2k+1)=12Nlog(N)+2γ+3log(2)12N+O(N), \sum_{k=0}^{N-1} \tau(2k+1) = \frac{1}{2}\,N\log(N) + \frac{2\gamma+3\log(2)-1}{2}N + O(\sqrt{N}), where γ\gamma is Euler's constant.

  11. What is the analogue of Dirichlet's asymptotic formula for a sum of the form k=0N1τ(qk+r) \sum_{k=0}^{N-1} \tau(qk+r) , where 0<r<q0<r<q are fixed integers and r,qr,q are relatively prime?

#NumberTheory #Math

Note by John Smith
7 years, 10 months ago

No vote yet
21 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Most of these problems are direct results of thinking of numbers in a sieve-like fashion (like Sieve of Eratosthenes). 1. This sieve will go through all multiples nn of aa and increment the sum by 1n4\frac{1}{n^4} for each value of aa. Let ab=nab=n. n=1τ(n)n4=a=1b=11(ab)4=a=1[1a4b=11b4]=[k=11k2]2=π88100\begin{aligned} \sum_{n=1}^\infty\frac{\tau(n)}{n^4} &= \sum_{a=1}^\infty\sum_{b=1}^\infty\frac{1}{(ab)^4} \\ &= \sum_{a=1}^\infty\left[\frac{1}{a^4}\sum_{b=1}^\infty\frac{1}{b^4}\right] \\ &= \left[\sum_{k=1}^\infty\frac{1}{k^2}\right]^2 \\ &= \frac{\pi^8}{8100} \end{aligned} 2. This sieve will go through all multiples nn of aa and increment the sum by 1n\frac{1}{n} if nn is odd and decrement the sum by 1n\frac{1}{n} if nn is even. n=1(1)n1τ(n)n=a=1b=1(1)ab1ab\sum_{n=1}^\infty\frac{(-1)^{n-1}\tau(n)}{n} = \sum_{a=1}^\infty\sum_{b=1}^\infty\frac{(-1)^{ab-1}}{ab} Now we know that ab1ab-1 will only be even if both aa and bb are odd. In this case, let a=2i1a=2i-1 and b=2j1b=2j-1 So, we have a=1b=1(1)ab1ab=a=1b=11ab+i=1j=12(2i1)(2j1)=[a=11a]2+2[i=11(2i1)]2=(n=1[1n+22n1])(n=1[1n+22n1])\begin{aligned} \sum_{a=1}^\infty\sum_{b=1}^\infty\frac{(-1)^{ab-1}}{ab} &= -\sum_{a=1}^\infty\sum_{b=1}^\infty\frac{1}{ab} + \sum_{i=1}^\infty\sum_{j=1}^\infty\frac{2}{(2i-1)(2j-1)} \\ &= -\left[\sum_{a=1}^\infty\frac{1}{a}\right]^2 + 2\left[\sum_{i=1}^\infty\frac{1}{(2i-1)}\right]^2 \\ &= \left(\sum_{n=1}^\infty\left[-\frac{1}{n}+\frac{\sqrt{2}}{2n-1}\right]\right)\left(\sum_{n=1}^\infty\left[\frac{1}{n}+\frac{\sqrt{2}}{2n-1}\right]\right) \end{aligned} We can see that the both factors diverge in magnitude, so this series diverges. 3. As we know 2n+12n+1 is odd, we will use a sieve similar to that used in (1), but letting 2n+1=(2a1)(2b1)2n+1=(2a-1)(2b-1). n=1τ(2n+1)(2n+1)2=1+n=1τ(2n1)(2n1)2=1+a=1b=11((2a1)(2b1))2=1+[a=11(2a1)2]2\begin{aligned} \sum_{n=1}^\infty\frac{\tau(2n+1)}{(2n+1)^2} &= -1+\sum_{n=1}^\infty\frac{\tau(2n-1)}{(2n-1)^2} \\ &= -1+\sum_{a=1}^\infty\sum_{b=1}^\infty\frac{1}{((2a-1)(2b-1))^2} \\ &= -1+\left[\sum_{a=1}^\infty\frac{1}{(2a-1)^2}\right]^2 \end{aligned} To evaluate this summation, note that n=11n2=n=1[1(2n1)2+1(2n)2]\sum_{n=1}^\infty\frac{1}{n^2}=\sum_{n=1}^\infty\left[\frac{1}{(2n-1)^2}+\frac{1}{(2n)^2}\right] so n=1τ(2n+1)(2n+1)2=1+(34π26)2=π4641\sum_{n=1}^\infty\frac{\tau(2n+1)}{(2n+1)^2}=-1+\left(\frac{3}{4}\frac{\pi^2}{6}\right)^2=\frac{\pi^4}{64}-1 4. Using methods similar to those in (1) and (3), let aa and bb be integers such that (2a1)b=n(2a-1)b=n. n=1τ2(n)n2=a=1b=11((2a1)b)2=π448\sum_{n=1}^\infty\frac{\tau_2(n)}{n^2}=\sum_{a=1}^\infty\sum_{b=1}^\infty\frac{1}{((2a-1)b)^2}=\frac{\pi^4}{48} 5. This one is a bit more intuitive than the others. Since each number divides 11, we know τ2(n)1\tau_2(n)\ge1, meaning it diverges by comparison: n=1τ2(n)n>n=11n=\sum_{n=1}^\infty\frac{\tau_2(n)}{n}\gt\sum_{n=1}^\infty\frac{1}{n}=\infty 6. Think every three numbers: 13k2+13k113k>13k\frac{1}{3k-2}+\frac{1}{3k-1}-\frac{1}{3k}>\frac{1}{3k} By comparison to k=113k\sum_{k=1}^\infty\frac{1}{3k}, this sum diverges. 7. Similar to the method in (2), let's just find the sum of 1n2\frac{1}{n^2} and subtract the multiples of 33 twice so we get the desired results: n=11n2n=12(3n)2=7π254\sum_{n=1}^\infty\frac{1}{n^2}-\sum_{n=1}^\infty\frac{2}{(3n)^2}=\frac{7\pi^2}{54} I'm still working on 8, 9, 10, and 11... insights anyone?

Cody Johnson - 7 years, 9 months ago

Log in to reply

I think there's a minor typo in P1. :)

Zi Song Yeoh - 7 years, 7 months ago

John S., Thank you very very much! When I first glanced at the questions, they seems to me to be very difficult. After I read the blog post, I solved them in a few seconds! I'm amazed by analytic number theory, because the result seems to appear in a magic way.

I'm not very practical with analytic calculus; do you think I could read a book about analytic number theory? In that case, could you suggest me one?

Andrea Marino - 7 years, 10 months ago

Log in to reply

I'm glad you enjoyed the post, Andrea! If you are interested in analytic number theory and would like to know more, as a starting point I would recommend Tom Apostol's "Introduction to Analytic Number Theory". You may find that this is exactly what you are looking for, but if you decide that you want something different, feel free to ask again here.

John Smith Staff - 7 years, 10 months ago

I've solved (although not very rigorously) the first seven questions without using Dirichlet series. I only used the facts k=11k2=π26 \sum _{k=1}^{\infty } \frac{1}{k^2}=\frac{\pi ^2}{6} and k=11k4=π490 \sum _{k=1}^{\infty } \frac{1}{k^4}=\frac{\pi ^4}{90}

Ivan Stošić - 7 years, 10 months ago

Log in to reply

You did use Dirichlet series -- if only because the questions themselves are about Dirichlet series! For instance, in my view, the two formulas you mentioned in your comment are calculations of ζ(2)\zeta(2) and ζ(4)\zeta(4).

Certainly, there is an overlap between problems for which one can use Dirichlet series methods and problems in which other methods can be used. However, Dirichlet series provide a very convenient general framework for thinking about questions 1-9, and after you go through these examples, you will be able to apply the same ideas to a wide variety of other situations.

John Smith Staff - 7 years, 10 months ago

Log in to reply

will any one tell me what is Dirichlet series??pls??i am new to this site.and i just still dont know what to do here or how can i get my solution???

Mansi Shukla - 7 years, 10 months ago

Log in to reply

@Mansi Shukla Welcome to Brilliant! Click the link in the first paragraph that says this blog post (you can also click on the link in this comment, it's the same URL). That blog entry explains the main ideas you need to approach the problems listed here.

John Smith Staff - 7 years, 10 months ago

What is Dirichlet Series?

Immanuel Panjaitan - 7 years, 10 months ago

can I make discussion after some months. it will take time for me to study the chapter.

Subhadeep Biswas - 7 years, 10 months ago

Log in to reply

Of course, you are welcome to add comments or start your own discussion at any time.

John Smith Staff - 7 years, 10 months ago

Can somebody help me with Question 2 and 8?

Shiva Chidambaram P - 7 years, 9 months ago

Log in to reply

Hint: for Question 8 (the conditional convergence part), it is possible to generalize the strategy used in this proof. For Question 2, you can either adapt the calculation given here, which is the faster method, or prove convergence first (using a method similar to the one you would use for question 8) and then compute the sum itself using the strategy I explained in my blog post.

John Smith Staff - 7 years, 9 months ago
×

Problem Loading...

Note Loading...

Set Loading...