Timeline for Simultaneous lcms
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2015 at 10:24 | comment | added | Stijn | Whoops, that was a mistake, I forgot the backslash before infty to make the superscript $\infty$ | |
| Jul 2, 2015 at 9:03 | comment | added | Max Alekseyev | @Stijn: For example, when $d=p$ is prime, $T(d;r)$ simplifies to $\delta_{r,q_p}$ (Kronecker's delta), which is not unexpected. What is "nfty" in your expression? | |
| Jul 2, 2015 at 2:44 | comment | added | Stijn | Aha, this looks like a pain to compute. Are there any nice identities which would simplify this in an alternating sum? I.e. if we say that $T(d; r)$ is the number of unordered pairwise distinct solutions then I'd like to compute $\sum_{r = 1} ^infty (-1)^r T(d; r)$ (although it's really a finite sum) | |
| Jul 1, 2015 at 19:44 | comment | added | Gerhard Paseman | Gee Max, you make it look so easy. Gerhard "Unready To Compute Stirling Numbers" Paseman, 2015.07.01 | |
| Jul 1, 2015 at 19:39 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 199 characters in body
|
| Jul 1, 2015 at 19:36 | history | undeleted | Max Alekseyev | ||
| Jul 1, 2015 at 19:33 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 199 characters in body
|
| Jul 1, 2015 at 13:27 | history | deleted | Max Alekseyev | via Vote | |
| Jul 1, 2015 at 13:26 | history | edited | Max Alekseyev | CC BY-SA 3.0 |
added 222 characters in body
|
| Jul 1, 2015 at 13:19 | history | answered | Max Alekseyev | CC BY-SA 3.0 |