Are you good at Summation?

Algebra Level 5

[ k = 1 1000 k ( log 2 k log 2 k ) ] ( m o d 1000 ) = ? \Bigg [ \displaystyle\sum_{k = 1}^{1000} k ( \lceil \log_{\sqrt{2}} k \rceil - \lfloor \log_{\sqrt{2}} k \rfloor ) \Bigg ] \pmod {1000} = \ ?


The problem is not original , I found it nice so posted it here.


The answer is 477.

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

We will have log 2 k log 2 k = 1 \lceil \log_{\sqrt{2}} k \rceil - \lfloor \log_{\sqrt{2}} k \rfloor = 1 for all positive integers k k except for the non-negative integer powers of 2 , 2, for which the difference is 0. 0.

Thus N = k = 1 1000 k n = 0 9 2 n = 500 1001 1023 477 ( m o d 1000 ) . N = \displaystyle\sum_{k=1}^{1000} k - \sum_{n=0}^{9} 2^{n} = 500*1001 - 1023 \equiv \boxed{477} \pmod{1000}.

Parth Lohomi - 6 years, 2 months ago

Log in to reply

Hahaha. Thanks for that. :)

Brian Charlesworth - 6 years, 2 months ago

Log in to reply

Oh You Are great!!

Parth Lohomi - 6 years, 2 months ago

Parth Lohomi - 6 years, 2 months ago

Log in to reply

@Parth Lohomi Jim Rockford was the best! Thanks for this, and for the Einstein image; poor Albert looks like he lost his keys, or maybe just his Theory of Everything. :P

Brian Charlesworth - 6 years, 2 months ago

Lol this is an AIME question.

Alan Yan - 5 years, 9 months ago

Same way! Easy question

Shreyash Rai - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...