Timeline for Computing zeta(k), for k odd, using Fourier coefficients
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2013 at 14:33 | history | edited | Willie Wong | CC BY-SA 3.0 |
Converted to MathJax http://meta.mathoverflow.net/a/385/3948
|
| Nov 6, 2009 at 18:07 | answer | added | David Hansen | timeline score: 6 | |
| Nov 6, 2009 at 17:41 | answer | added | Qiaochu Yuan | timeline score: 3 | |
| Nov 6, 2009 at 17:27 | answer | added | David Hansen | timeline score: 5 | |
| Nov 6, 2009 at 15:11 | answer | added | Gerald Edgar | timeline score: 4 | |
| Nov 6, 2009 at 11:53 | answer | added | David E Speyer | timeline score: 9 | |
| Nov 6, 2009 at 11:51 | answer | added | Charles Siegel | timeline score: 0 | |
| Nov 6, 2009 at 4:33 | comment | added | Qiaochu Yuan | You should also clarify what you mean by "explicitly constructed." The function with Fourier coefficients 1/n^k is perfectly well-defined as is. | |
| Nov 6, 2009 at 4:19 | comment | added | Qiaochu Yuan | Are you aware that there is no relatively straightforward computation of zeta(k) when k is odd, at least in terms of other constants? | |
| Nov 6, 2009 at 4:16 | history | asked | Kirill Levin | CC BY-SA 2.5 |