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.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Bob's right: the answer reminded me of some Fourier transform computations I did some years back.
Let f(x)=cosh(x) on the interval (−π,+π] and repeated periodically through the real line via f(x+2π)=f(x). It's continuous and nice enough that its Fourier series converges pointwise.
Convergence of Fourier Transform
Specifically, at the point x=π, the one-sided derivatives exist:
where the second equality follows from f(x)=cosh(x−2π) when x is slightly more than 2π. Furthermore, the one-sided derivatives of f(x) have only discrete discontinuities. One can then apply Dini criterion to show that the Fourier series converges.
Computing the Fourier Transform
Omitting the details, the Fourier coefficients of f(x) are given by:
Is there a systematic way to approach these questions? I've seen Fourier Series solutions before, but they always struck me as most likely discovered by accident. For a simpler example, why would you immediately think to consider the Fourier Series of f(x)=∣x∣ if you wanted to find ζ(2)?
The second answer here http://math.stackexchange.com/questions/8337/different-methods-to-compute-sum-limits-n-1-infty-frac1n2 makes the choice much more obvious (albeit it uses the function x2, not ∣x∣, although of course these choices would yield identical results, just square at the end).
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:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Let f(x)=coshx, and let's try to find the Fourier Series of f(x) on [−π,π].
cn=2π1∫−ππe−inxcoshxdx =4π1∫−ππe−inx(ex+e−x)dx =4π1∫−ππ(e(1−in)x+e(−1−in)x)dx
=4π1[1−ine(1−in)x+−1−ine(−1−in)x]−ππ =4π1[1−ine(1−in)π−e−(1−in)π+−1−ine(−1−in)π−e−(−1−in)π]
=4π(−1)n[1−ineπ−e−π+−1−ine−π−eπ] =2π(−1)nsinhπ[1−in1−1+in1] =π(n2+1)(−1)nsinhπ.
Therefore, f(x)=coshx=n=−∞∑∞π(n2+1)(−1)nsinhπeinx.
Thus, f(π)=coshπ=n=−∞∑∞π(n2+1)sinhπ, and so, n=−∞∑∞n2+11=sinhππcoshπ.
Subtracting the n=0 term and dividing by 2 gives: n=1∑∞n2+11=2sinhππcoshπ−21=2πcothπ−21.
EDIT: This is essentially what C L. did, except with complex Fourier coefficients instead.
Log in to reply
We both posted the exact same solution at the same time. :D
Bob's right: the answer reminded me of some Fourier transform computations I did some years back.
Let f(x)=cosh(x) on the interval (−π,+π] and repeated periodically through the real line via f(x+2π)=f(x). It's continuous and nice enough that its Fourier series converges pointwise.
Convergence of Fourier Transform
Specifically, at the point x=π, the one-sided derivatives exist:
x→π−limx−πf(x)−coshπ=sinhπ,x→π+limx−πf(x)−coshπ=sinh(−π)=−sinhπ
where the second equality follows from f(x)=cosh(x−2π) when x is slightly more than 2π. Furthermore, the one-sided derivatives of f(x) have only discrete discontinuities. One can then apply Dini criterion to show that the Fourier series converges.
Computing the Fourier Transform
Omitting the details, the Fourier coefficients of f(x) are given by:
anbn=π1∫−ππf(x)cosnxdx=π1∫−ππcoshxcosnxdx=2(−1)nπsinhπ,=π1∫−ππf(x)sinnxdx=π1∫−ππcoshxsinnxdx=0.
Thus, the Fourier expansion gives:
f(x)=21a0+n=1∑∞(ancosnx+bnsinnx).=πsinhπ(1+2n=1∑∞(−1)nn2+1cosnx)
Substituting x=π then gives:
coshπ=πsinhπ(1+2n=1∑∞n2+11)
which gives Bob's answer.
Here's a shorter way.
Note that cot(x)=x1+∑k=1∞x2−k2π22x (Proof: use infinite product for sine, take natural logs, differentiate, rearrange). Thus,
π21∑k=1∞π2x2−k22x=cot(x)−x1
∑k=1∞k2−π2x2x=2−π2(cot(x)−x1)
Let x=iπ,
∑k=1∞k2+1iπ=2−π2(cot(iπ)−iπ1)
∑k=1∞k2+11=2iπ(cot(iπ)−iπ1)
∑k=1∞k2+11=2iπsin(iπ)cos(iπ)−21
∑k=1∞k2+11=2iπisinh(π)cosh(π)−21
∑k=1∞k2+11=2πsinh(π)cosh(π)−21
Mathematica gave 2−1+2πcothπ. I know this isn't exactly the point, but sometimes the answer is the best place to start a question like this.
Is there a systematic way to approach these questions? I've seen Fourier Series solutions before, but they always struck me as most likely discovered by accident. For a simpler example, why would you immediately think to consider the Fourier Series of f(x)=∣x∣ if you wanted to find ζ(2)?
Log in to reply
The second answer here http://math.stackexchange.com/questions/8337/different-methods-to-compute-sum-limits-n-1-infty-frac1n2 makes the choice much more obvious (albeit it uses the function x2, not ∣x∣, although of course these choices would yield identical results, just square at the end).
Excellent work, everybody!