⌊ 2 1 ⌋ + ⌊ 2 1 + 1 0 0 1 ⌋ + ⌊ 2 1 + 1 0 0 2 ⌋ + … + ⌊ 2 1 + 1 0 0 2 9 9 ⌋ = ?
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.
= [ 2 1 ] + [ 2 1 + 1 0 0 1 ] + [ 2 1 + 1 0 0 2 ] + … + [ 2 1 + 1 0 0 2 9 9 ]
= [ 2 1 ] + … + [ 2 1 + 1 0 0 4 9 ] + [ 2 1 + 1 0 0 5 0 ] + … + [ 2 1 + 1 0 0 1 4 9 ] + [ 2 1 + 1 0 0 1 5 0 ] + … + [ 2 1 + 1 0 0 2 4 9 ] + [ 2 1 + 1 0 0 2 5 0 ] + … + [ 2 1 + 1 0 0 2 9 9 ]
= 0 × 5 0 + 1 × 1 0 0 + 2 × 1 0 0 + 3 × 5 0
= 4 5 0
Do note that this problem is basically trivial using Hermite's Identity (which is almost equivalent to your method).
The given sum can be rewritten as,
S = k = 0 ∑ 2 9 9 ⌊ 2 1 + 1 0 0 k ⌋ = m = 0 ∑ 2 k = 0 ∑ 9 9 ⌊ 2 ( 2 m + 1 ) + 1 0 0 k ⌋
Applying Hermite's Identity and simplifying gives,
S = 5 0 m = 0 ∑ 2 ( 2 m + 1 ) = 5 0 × 3 2 = 4 5 0
You can also generalize it a bit. Simple application of Hermite's Identity yields the following result :
∀ x ∈ R , m , α ∈ Z + , S ( m , α , x ) = k = 0 ∑ m α − 1 ⌊ x + α k ⌋ = m ( ⌊ α x ⌋ + 2 α ( m − 1 ) )
The problem posed here is evaluating S ( 3 , 1 0 0 , 2 1 ) .
Log in to reply
Are you 17 years old??
From where do you learnt all this?
Log in to reply
Yes, I'm 17 years old (and 4 months, to be precise). I learnt all this stuff mostly from the internet.
Log in to reply
@Prasun Biswas – Have you given the IIT Exam ?
Log in to reply
@Akhil Bansal – Nope. And I have almost zero interest in it. I was not cut out for engineering anyway. And IITs have extremely high standards. I'm currently studying at Jadavpur University and am planning to give the CMI and ISI entrance exams next year (I missed the exam dates this year).
T h a n k s ! ! for improving my knowledge!!
Log in to reply
Wait a second, I just realized there's a minor error in the generalization. Let me edit it first.
EDIT: The error has been corrected now.
Amazing Solution, thanks for sharing it.
Same Method
Log in to reply
This is the only possible method.
Same method...good one.
Nice solution
I have solved the solution over and over again and each time I get \huge598.5 \approx\ 600}
Log in to reply
This is not an arithmetic progression. It has got a sign of the floor function on every term if you see clearly. You can't solve by taking that as an AP, you need to use the concept of the floor function. And when you approximated the value of 598.5, why didn't you get 599? Why 600?
I always get 5 9 8 . 5 ≈ 6 0 0
⌊ 2 1 ⌋ + ⌊ 2 1 + 1 0 0 1 ⌋ + ⌊ 2 1 + 1 0 0 2 ⌋ + … + ⌊ 2 1 + 1 0 0 2 9 9 ⌋
= ⌊ 2 1 ⌋ + ⌊ 2 1 + 1 0 0 1 ⌋ + ⌊ 2 1 + 1 0 0 1 + 1 0 0 1 ⌋ + … + ⌊ 2 1 + 1 0 0 1 + 1 0 0 1 + 1 0 0 1 + … ( 2 9 9 t e r m s ) ⌋
T h i s i s a n A r i t h m e t i c P r o g r e s s i o n ( d = 1 0 0 1 ) i n w h i c h a 1 = 2 1 , a n = 2 1 + 1 0 0 2 9 9 a n d n = 3 0 0 . S o , S n = 2 n ( a 1 + a n )
S 3 0 0 = 2 3 0 0 ( 2 1 + 2 1 + 1 0 0 2 9 9 ) S 3 0 0 = 1 5 0 ( 1 + 1 0 0 2 9 9 ) S 3 0 0 = 1 5 0 ( 1 0 0 3 9 9 )
S 3 0 0 = 5 9 8 . 5 ≈ 6 0 0
Log in to reply
The range of the floor function is integers. So, from closure in Z , the sum of all given floor expressions must be an integer, right !
The problem is that this is not an arithmetic progression. Note the floor function along with the terms. Let's take a smaller sum as an example. For instance, consider the sum ⌊ 3 1 ⌋ + ⌊ 3 2 ⌋ + ⌊ 1 ⌋ .
According to your argument , since { 3 1 , 3 2 , 1 } is an arithmetic progression with a 1 = 3 1 , n = 3 and a n = 1 , the sum is 2 using the formula for summing AP.
But, note that we're not summing the terms of the arithmetic progression. We're summing the floored values of the terms of the progression. Use the definition of floor function . Using that, the sum in the mentioned example actually simplifies to 0 + 0 + 1 = 1 which is = 2 .
Do you see where you made the mistake now?
I always get 5 9 8 . 5 ≈ 6 0 0
⌊ 2 1 ⌋ + ⌊ 2 1 + 1 0 0 1 ⌋ + ⌊ 2 1 + 1 0 0 2 ⌋ + … + ⌊ 2 1 + 1 0 0 2 9 9 ⌋
= ⌊ 2 1 ⌋ + ⌊ 2 1 + 1 0 0 1 ⌋ + ⌊ 2 1 + 1 0 0 1 + 1 0 0 1 ⌋ + … + ⌊ 2 1 + 1 0 0 1 + 1 0 0 1 + 1 0 0 1 + … ( 2 9 9 t e r m s ) ⌋
T h i s i s a n A r i t h m e t i c P r o g r e s s i o n ( d = 1 0 0 1 ) i n w h i c h a 1 = 2 1 , a n = 2 1 + 1 0 0 2 9 9 a n d n = 3 0 0 . S o , S n = 2 n ( a 1 + a n )
S 3 0 0 = 2 3 0 0 ( 2 1 + 2 1 + 1 0 0 2 9 9 ) S 3 0 0 = 1 5 0 ( 1 + 1 0 0 2 9 9 ) S 3 0 0 = 1 5 0 ( 1 0 0 3 9 9 )
S 3 0 0 = 5 9 8 . 5 ≈ 6 0 0
You seem to be forgetting that you are taking the floor of 1/2 and (1/2+299/100). The floor of 1/2 is 0, and the floor of 1/2+299/100 is 3. Therefore, you get 150 times 3 or 450.
Problem Loading...
Note Loading...
Set Loading...
Let the sum of the sequence be S , then:
S = k = 0 ∑ 2 9 9 ⌊ 2 1 + 1 0 0 k ⌋ = k = 0 ∑ 2 9 9 ⌊ 1 0 0 5 0 + k ⌋ = k = 0 ∑ 4 9 ⌊ 1 0 0 5 0 + k ⌋ + k = 5 0 ∑ 1 4 9 ⌊ 1 0 0 5 0 + k ⌋ + k = 1 5 0 ∑ 2 4 9 ⌊ 1 0 0 5 0 + k ⌋ + k = 2 5 0 ∑ 2 9 9 ⌊ 1 0 0 5 0 + k ⌋ = 5 0 ( 0 ) + 1 0 0 ( 1 ) + 1 0 0 ( 2 ) + 5 0 ( 3 ) = 0 + 1 0 0 + 2 0 0 + 1 5 0 = 4 5 0