Timeline for Is there a way to find the value of $1^n+ 2^n +\cdots + m^n$ modulo $x$?
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 17, 2012 at 18:20 | comment | added | sperners lemma | please note I made a mistake in my answer. | |
Nov 17, 2012 at 16:20 | vote | accept | abhishek srivastava | ||
S Nov 17, 2012 at 15:05 | history | suggested | sperners lemma |
this isn't actually an exponential sum (!)
|
|
Nov 17, 2012 at 15:01 | review | Suggested edits | |||
S Nov 17, 2012 at 15:05 | |||||
Nov 17, 2012 at 15:00 | answer | added | sperners lemma | timeline score: 3 | |
Nov 17, 2012 at 14:52 | review | First posts | |||
Nov 17, 2012 at 14:53 | |||||
Nov 17, 2012 at 14:50 | history | edited | Cameron Buie | CC BY-SA 3.0 |
edited title
|
S Nov 17, 2012 at 14:45 | history | suggested | Stefan Hansen | CC BY-SA 3.0 |
Fixed latex
|
Nov 17, 2012 at 14:40 | review | Suggested edits | |||
S Nov 17, 2012 at 14:45 | |||||
Nov 17, 2012 at 14:36 | comment | added | Gottfried Helms | What about wikipedia:bernoulli-polynomials , or googling for "sums-of-like-powers" ? | |
Nov 17, 2012 at 14:34 | history | asked | abhishek srivastava | CC BY-SA 3.0 |