Hello, I have a problem need to solve:
S(n) = 1^k + 2^k +..+n^k
input: n<=10^9, k<=40
output: S(n)%(10^9+7).
One more issue:
how to calculate ((n^k)/x)%p which very big n and k.
Thank for helping me.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 149 |
| 3 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
Hello, I have a problem need to solve:
S(n) = 1^k + 2^k +..+n^k
input: n<=10^9, k<=40
output: S(n)%(10^9+7).
One more issue:
how to calculate ((n^k)/x)%p which very big n and k.
Thank for helping me.
| Name |
|---|



See here for finding S(n). ((n^k)/x)%p = ((n^k)%(x*p))/x. Use binary exponentiation to evaluate (n^k)%(x*p).
Thanks you
Easy to prove that the answer is a polynomial with deg ≤ k + 1. So you can find its coefficients using Gaussian elimination or any other way to interpolate it.
Easy to prove that the answer is a polynomial with deg ≤ k + 1.
how?
For instance, using recurrent equation for sum of k-th powers through previous powers sums (see the link above).
Check Div1-500 here.