Simple but good

Here's a problem that I found out in an olympiad book......and I really enjoyed solving it.

The question is :

Find the sum of the given expression :

[n+12] + [n+222] + [n+2223] + ................ + [n+2k2k+1]

where [.] denotes the greatest integer function.

Hint : This is not at all tough...but you need to know a small theorem. If no posts are there in the next 2 days...I'll post the theorem too.

4 Answers

1
Great Dreams ·

well i asked my friend about this question
she told me a huge hint : HERMITE's identity
google it
then we can easily break our rth term in two fragments

1
Bicchuram Aveek ·

:-)

1
Great Dreams ·

Σ[n2k+1+12] =Σ([n2k-1]-[n2k] )

1
Bicchuram Aveek ·

:-) again !

Your Answer

Close [X]