Count the number of squares on a 1 0 ∗ 1 0 chess board.
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.
Now its good! :P
Log in to reply
The question was confusing. I thought it meant spaces on a Chess board. This makes more sense, but the wording could be revised for clarification.
Log in to reply
Sorry but I am not a moderator nor I can edit this question. We have to wait for the problem poser to read your comment.Or you can post this as a dispute. Thanks!
Well done @Mehul Arora ! I liked the generelised form for this, it can make everything a lot easier.
Log in to reply
Thanks! @Sravanth Chebrolu I am Glad that you liked it ⌣ ¨
Log in to reply
Welcome @Mehul Arora !
By using the above formula and putting n= 10, we get , 385.
Please up vote if you like it.
Let no. of squares be n, then by the formula f(n) = n * (n + 1) * (2 * n + 1) / 6 the answer is 385.
Idont understand why did you do f(n) = ......
Problem Loading...
Note Loading...
Set Loading...
The number Of Squares in n ∗ n Square is
1 2 + 2 2 + 3 2 + . . . . . . . n 2
And, 1 2 + 2 2 + 3 2 + . . . . . . . n 2 = 6 n ( n + 1 ) ( 2 n + 1 )
Putting n = 1 0 , We get 385 ⌣ ¨
Enjoy!