For every positive integer , let denote the unique positive integer such that
If find the remainder when is divided by 1000.
For example, and .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It's clear that b ( p ) = n if and only if ( n − 1 / 2 ) 2 < p < ( n + 1 / 2 ) 2 , which translates to n 2 − n + 1 ≤ p ≤ n 2 + n . There are 2 n values of p in this range. When n = 4 4 we get that p runs from 1 8 9 3 to 1 9 8 0 . When n = 4 5 the range runs from 1 9 8 1 to 2 0 7 0 , so there are 2 7 values of p in the given sum for which b ( p ) = 4 5 .
So the answer is ∑ n = 1 4 4 n ( 2 n ) + 4 5 ⋅ 2 7 = 5 9 9 5 5 . The answer is 9 5 5 .