A cruel and fickle king

Algebra Level 4

For the past decade, the king of Mathlandia has forced his subjects to build a pyramid in his honor. The king decreed the pyramid to be constructed with cubic stone slabs. The king also decreed the pyramid to be built in 100 square levels, with each subsequent level 2 units less on a side than the previous level. The top level was to be constructed with a single cube. (See the picture for an example of a pyramid 3 levels high constructed in the same way).

Moments after the final cube was placed, the king changed his mind. He ordered the pyramid to be taken down, and in its place, a cubic monolith was to be built. He ordered the monolith to be built as large as possible with the same stone slabs the pyramid was made of.

The king would tolerate no waste, so he ordered one of his subjects to be sacrificed for each leftover slab of stone.

How many of the king's subjects will be sacrificed?


The answer is 2300.

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.

3 solutions

Andy Hayes
Oct 16, 2015

The number of cubic stones in the pyramid will be the sum of the first 100 squares of odd numbers. We can write and simplify the finite series:

k = 1 100 ( 2 k 1 ) 2 = k = 1 100 ( 4 k 2 4 k + 1 ) = 4 k = 1 100 k 2 4 k = 1 100 k + 100 \sum\limits_{k=1}^{100}{(2k-1)^2}=\sum\limits_{k=1}^{100}{(4k^2-4k+1)}=4\sum\limits_{k=1}^{100}{k^2}-4\sum\limits_{k=1}^{100}{k}+100

These series can be calculated using the sum of squares formula and the sum of natural numbers formula:

k = 1 n k 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \sum\limits_{k=1}^{n}{k^2}=\frac{n(n+1)(2n+1)}{6}

k = 1 n k = n ( n + 1 ) 2 \sum\limits_{k=1}^{n}{k}=\frac{n(n+1)}{2}

Using these formulas, we obtain the number of stones in the pyramid to be 1333300 1333300 . The largest perfect cube less than this number is 11 0 3 = 1331000 110^3=1331000 . Thus, there are 2300 \boxed{2300} stones left over.

Arjen Vreugdenhil
Oct 19, 2015

Working this problem, I wrote the first few partial sums of the series 1 2 + 3 2 + 5 2 + 7 2 + 1^2 + 3^2 + 5^2 + 7^2 + \cdots : 1 , 10 , 35 , 84 , 165 , 1,\ 10,\ 35,\ 84,\ 165,\ \dots This "feels" very much like Pascal's triangle... indeed, it appears that 1 2 + 3 2 + 5 2 + + ( 2 n 1 ) 2 n terms = ( 2 n + 1 3 ) . \underbrace{1^2 + 3^2 + 5^2 + \cdots + (2n-1)^2}_{n\ \text{terms}} = \left(\begin{array}{c} 2n+1 \\ 3 \end{array}\right). (Proof: see below.)

The number of stones is therefore ( 201 3 ) = 201 200 199 3 2 1 = 67 100 199 = 1 333 300 , \left(\begin{array}{c} 201 \\ 3 \end{array}\right) = \frac{201\cdot200\cdot199}{3\cdot 2\cdot 1} = 67\cdot 100\cdot 199 = 1\:333\:300, which is easily recognized as slightly more than 1 331 000 = 11 0 3 1\:331\:000 = 110^3 . The answer is therefore 1 333 300 1 331 000 = 2300 . 1\:333\:300 - 1\:331\:000 = \boxed{2300}.

Proof of the claim made above, by induction:

  • Clearly, for just one term we have 1 2 = 1 = ( 3 3 ) . 1^2 = 1 = \left(\begin{array}{c} 3 \\ 3 \end{array}\right).

  • Suppose the statement is true for n n . We will prove it is also true for n = n + 1 n' = n+1 . Add the ( n + 1 ) (n+1) th term: ( 1 2 + 3 2 + 5 2 + + ( 2 n 1 ) 2 ) + ( 2 n + 1 ) 2 = ( 2 n + 1 3 ) + ( 2 n + 1 ) 2 = ( 2 n + 1 ) ( 2 n ) ( 2 n 1 ) 6 + ( 2 n + 1 ) 2 = 2 n + 1 6 ( ( 2 n ) ( 2 n 1 ) + 6 ( 2 n + 1 ) ) = 2 n + 1 6 ( 4 n 2 + 10 n + 6 ) = 2 n + 1 6 ( 2 n + 2 ) ( 2 n + 3 ) = ( 2 n + 1 ) ( 2 n ) ( 2 n 1 ) 6 = ( 2 n + 1 3 ) . (1^2 + 3^2 + 5^2 + \cdots + (2n-1)^2) + (2n+1)^2 \\ = \left(\begin{array}{c} 2n+1 \\ 3 \end{array}\right) + (2n+1)^2 \\ = \frac{(2n+1)(2n)(2n-1)}{6} + (2n+1)^2 \\ = \frac{2n+1}{6}\left( (2n)(2n-1) + 6(2n+1)\right) \\ = \frac{2n+1}{6}(4n^2+10n+6) \\ = \frac{2n+1}{6}(2n+2)(2n+3) \\ = \frac{(2n'+1)(2n')(2n'-1)}{6}\\ = \left(\begin{array}{c} 2n'+1 \\ 3 \end{array}\right).

Kevin Forman
Dec 1, 2020

Another way to find the sum of the odd squares is to simply add the sum of all of the squares up to 199, and then subtract the even squares up to 198, which can be recognized as 4 times the sum of all of the squares up to 99.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...