For Each positive integer p

For every positive integer p p , let b ( p ) b(p) denote the unique positive integer k k such that k p < 1 2 . |k-\sqrt{p}| < \dfrac{1}{2}.

If S = p = 1 2007 b ( p ) S = \displaystyle\sum_{p=1}^{2007} b(p) find the remainder when S S is divided by 1000.

For example, b ( 6 ) = 2 b(6) = 2 and b ( 23 ) = 5 b(23) = 5 .


The answer is 955.

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.

1 solution

Patrick Corn
Apr 1, 2015

It's clear that b ( p ) = n b(p) = n if and only if ( n 1 / 2 ) 2 < p < ( n + 1 / 2 ) 2 (n-1/2)^2 < p < (n+1/2)^2 , which translates to n 2 n + 1 p n 2 + n n^2-n+1 \le p \le n^2 + n . There are 2 n 2n values of p p in this range. When n = 44 n =44 we get that p p runs from 1893 1893 to 1980 1980 . When n = 45 n = 45 the range runs from 1981 1981 to 2070 2070 , so there are 27 27 values of p p in the given sum for which b ( p ) = 45 b(p) = 45 .

So the answer is n = 1 44 n ( 2 n ) + 45 27 = 59955 \sum_{n=1}^{44} n(2n) + 45 \cdot 27 = 59955 . The answer is 955 \fbox{955} .

@Parth Lohomi beautiful problem ....... enjoyed it :) ... . a nice modification of ceiling and floor function :p

Abhinav Raichur - 6 years, 2 months ago

Log in to reply

Although I am very late to reply , but still thanks!

Parth Lohomi - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...