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.
Simple standard approach. You just have to be careful with counting exactly how many times n appears in the sum.
As the title suggest WE ARE THE RIGHT YEAR FOR THIS !! means 2015, I guessed and got correct.
Log in to reply
me too, the same!
Log in to reply
next time, these kinds of clues should not be found in the title. takes away from the purpose of this website
Exactly!!! :-)
Hiii....i calculate the sum in calculater ,it shows the answer 1920.1....
Log in to reply
⌈ x ⌉ gives integer values ≥ x . There won't be a decimal answer. ⌈ 3 . 0 2 ⌉ = 4
I did the same, Cheong
Is the square bracket not a symbol for greatest intezer function meaning the greatest intezer less than or equal to the number inside the brackets?
Log in to reply
No, ⌈ x ⌉ is least integer function or ceiling function (note that the right angles are at the top (ceiling)). It is the smallest integer ≥ x . Greatest integer function is the floor function (right angles at the bottom) ⌊ x ⌋ .
you have taken greatest integer ,i have taken lowest integer....:P
Input in WolframAlpha:
Sum (Ceiling [sqrt(k)]), k=1 to 202
Result = 2015
Nice clean and neat approach! :)
Although I solved the question but when I got 2015 I realized that the title gives the hint for the answer.
yeh. but this only true for a couple of more month.. and I have to know by then about how to deal with this problem My I should just say last year was the right year for this or 2015 was the right year for this..
Log in to reply
Haha Nice. Not for couple of more months. It's more than a couple. I suggest you to give another good name because this gives a big hint for the answer doesn't it. I loved the question and I liked solving it. I am following you for more good questions.
First, determine what ceil(sqrt(202)) is to know where to stop. ceil(sqrt(202)) = 15. So we're going to sum up the numbers between 1 and 15 a varying number of times. Be careful to stop before reaching 15^2 = 225 because that's too high (we're only going up to 202).
ceil(sqrt(1)) = 1
ceil(sqrt(2)) = 2
ceil(sqrt(3)) = 2
ceil(sqrt(4)) = 2
ceil(sqrt(5)) = 3
ceil(sqrt(6)) = 3
ceil(sqrt(7)) = 3
ceil(sqrt(8)) = 3
ceil(sqrt(9)) = 3
...
There's a pattern. They each appear an odd number of times. First 1, then 3, then 5, etc. We go up to 14 (which should appear 27 times), then we use 202-14^2 = 6 to determine that we sum up 15 only 6 times. So doing 1(1) + 3(2) + 5(3) + 7(4) + 9(5)..........27(14) + 6(15) = 2015 gives us our answer.
The answer is 2015.
How do you calculate the sum?
i took a long road.. - 1-2^2 u have 2 nos ..u can follow a pattern between consecutive squares.. multiply ad add+90(remember we still have 6 nos after 196
just guessed using the title. got it correct, however this won't work in a year from now
😆it is step function is not it
He say that we are in the right year for this and it is 2015... didnt even have to look at the problem...
I guessed 2015 cuz thats the current year!
i took the long road: making a table.
for k = 1 only, ceil(sqrt(k)) = 1 for k = 2 to 4, ceil(sqrt(k)) = 2 for k = 5 to 9, ceil(sqrt(k)) = 3 all the way to for k = 170 to 196, ceil(sqrt(k)) = 14 for k = 197 to 202, ceil(sqrt(k)) = 15
then for each row, multiply each unique ceil(sqrt(k)) by the number of k's belonging to it
so for k = 1, product = 1 for k = 2 to 4, product = 6 for k = 5 to 9, product = 3*(9-5+1) = 15 all the way to for k = 170 to 196, product = 378 for k = 197 to 202, product = 90
then add all these products to get 2015
Problem Loading...
Note Loading...
Set Loading...
Since ⌈ 2 0 2 ⌉ = 1 5 , we have ⌈ k ⌉ ∈ { 1 , 2 , 3 , . . . 1 5 } . We note that ⌈ k ⌉ = n for ( n − 1 ) 2 < k ≤ n 2 and the number of k = n is n 2 − ( n − 1 ) 2 = 2 n − 1 for n = 1 4 and the number of ⌈ k ⌉ = 1 5 is 2 0 2 − 1 4 2 = 2 0 2 − 1 9 6 = 6 .
k = 1 ∑ 2 0 2 ⌈ k ⌉ = n = 1 ∑ 1 4 n ( 2 n − 1 ) + 6 ( 1 5 ) = n = 1 ∑ 1 4 ( 2 n 2 − n ) + 9 0 = 2 n = 1 ∑ 1 4 n 2 − n = 1 ∑ 1 4 n + 9 0 = 2 ( 6 1 4 ( 1 5 ) ( 2 9 ) − 2 1 4 ( 1 5 ) + 9 0 = 2 0 1 5