0%

Problem 487


Problem 487


Sums of power sums

Let fk(n) be the sum of the kth powers of the first n positive integers.

For example, f2(10) = 12 + 22 + 32 + 42 + 52 + 62 + 72 + 82 + 92 + 102 = 385.

Let Sk(n) be the sum of fk(i) for 1 ≤ i ≤ n. For example, S4(100) = 35375333830.

What is ∑ (S10000(1012) mod p) over all primes p between 2 ⋅ 109 and 2 ⋅ 109 + 2000?


幂之和之和

记fk(n)是前n个正整数的k次方的和。

例如,f2(10) = 12 + 22 + 32 + 42 + 52 + 62 + 72 + 82 + 92 + 102 = 385。

记Sk(n)是所有满足1 ≤ i ≤ n的fk(i)的和。例如,S4(100) = 35375333830。

对于所有在2 ⋅ 109与2 ⋅ 109 + 2000之间的素数p,求∑ (S10000(1012) mod p)。