In a store display, identical cubic boxes are stacked in square layers. Each layer has 1 fewer row and column than the layer directly beneath it. If the bottom layer has 100 boxes and the top layer has 1 box, how many boxes are used in the display?
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.
Good. Is there a systematic way to calculate the total number of boxes if the bottom layer has 10000 boxes instead?
Python 2.7:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
|
thats cool :-)
1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^2 + 9^2 + 10^2 = 385 you can even try it with legos :) , or any kind of cube...........
Since the boxes are displayed in square ways therefore there it will be in a form of 10 by 10 grid . First there are 100 boxes . Then 1 row and column is removed therefore their will be 81 boxes , then 64 , and so on . Therefore total boxes will be equal to the sum of square of first 10 natural numbers.
Do you know the formula for the sum of squares of first few positive integers?
Log in to reply
I just know the formula that is n(n+1)(2n+1)/6, but can you please tell the proof , I am very confused about it .
Log in to reply
n^3 - (n + 1)^3 = -3 n^2 - 3 n - 1
So
1^3 - 2^3 = -3 (1^2) - 3 (1) - 1
2^3 - 3^3 = -3 (2^2) - 3 (2) - 1
3^3 - 4^3 = -3 (3^2) - 3 (3) - 1
4^3 - 5^3 = -3(4^2) - 3 (4) - 1
..........................................................
n^3 - (n + 1)^3 = -3 n^2 - 3 n - 1
Adding we get
1^3 - (n + 1)^3 = -3 (sum of squares of n natural numbers)
-3(sum of n natural numbers)
-(sum of n ones) ................................................. (1)
Let (sum of squares of n natural numbers) be denoted by S
(sum of n natural numbers) = n (n + 1)/2
(sum of n ones) = n
Substituting in (1) we get
-(n^3 + 3 n^2 + n) = -3 S - 3 n(n + 1)/2 - n
S = n(n + 1)(2 n + 1)/6
Log in to reply
@Gamal Sultan – Great proof! Better than induction since you don't have to know the formula in advance!
Mathematical Induction.
1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^2 + 9^2 + 10^2 = 385
1^2 + 2^2 + 3^2 + .............. 10^2
= n(n + 1)(2 n + 1)/6 , n = 10
= 385
question: how to solve this using diferential calculus?
or an approach to consider it the volume of a pyramid?
Any thoughts on how to answer your question?
Problem Loading...
Note Loading...
Set Loading...
1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^2 + 9^2 + 10^2 = 385
It is squared since they are stacked in square layers
If we look at it by layer, the number of boxes are: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100. And adding all of them:
1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100 = 385
So there are 385 boxes used in the display.