← Complete problem index

PROJECT EULER · #0528

Constrained Sums

Statement only · SolvedOriginal problem ↗

Let S(n,k,b) represent the number of valid solutions to x1+x2+⋯+xk≤n, where 0≤xm≤bm for all 1≤m≤k.

For example, S(14,3,2)=135, S(200,5,3)=12949440, and S(1000,10,5)mod1000000007=624839075.

Find (∑10≤k≤15S(10k,k,k))mod1000000007.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.