6
$\begingroup$

I have a large cube made up of many smaller cubes. Each face of the cube is identical, and all of the smaller cubes are identical. I need to calculate the number of small cubes that make up the large cube. Just to make it clear, the cube is solid (made up of little cubes all the way through).

The only value I have to work this out from is the number of small cubes that make up the outermost layer. This number is $100,614,152$.

What is the simplest way to calculate the total number of small cubes making up the large cube?

  • 0
    @StevenStadnicki well spotted sir2012-12-07

5 Answers 5

9

Let the big cube be of dimension $(x+2)$ (made up of $(x+2)^3$ smaller cubes). Then $(x+2)^3-x^3=100,614,152$. This reduces to a quadratic equation which you can solve.

  • 1
    Not quite: it would be $(x+1)^3 - (x-1)^3 = 100,614,152$. Edit: the answer has been corrected.2012-12-06
6

Let $x$ be the number of small cubes along each edge of the large cube. Then each face of the large cube contains $x^2$ small cubes. $6x^2$ isn't the total number of cubes around the outside, though, because we're double-counting the cubes along each of the edges, so we need to subtract off $12x$. Then we aren't counting the cubes at the corners (we counted them three times--once in each face--and subtracted them three times), so we need to add back on 8. So we have $6x^2 -12x + 8 = 100,614,152.$ Now this is just a simple quadratic. Combine the terms on one side and use the quadratic formula (or Wolfram Alpha) to find that $x = 4096$.

2

If one big cube is divided into $n$ times smaller cubes, then there are $n^3$ cubes. Taking avay the outer layer, we are left with $(n-2)^3$ cubes. The difference is $ n^3-(n-2)^3= n^3-(n^3-6n^2+12n-8)=6n^2-12n+8$ and this shall equal $N=100614152$. Therefore, a good approximation for $n$ is given by $n=\sqrt {\frac N 6}\approx 4095.0004$ However, $n=4095$ leads to $6n^2-12n+8=100565018$, not quite your expected result. But with $n=4096$, the result is correct: $6n^2-12n+8=100614152$.

Note that trying to compute the solution of $6n^2-12n+(8- 100614152)$ would not have been easy due to rounding errors.

  • 0
    You are right, I didn't even try it and had in min that the other solution might be $\approx0$, while of course it is $\approx -n$.2012-12-07
1

Let the size of the small cube be $1 \times 1 \times 1$ and size of the larger cube be $n \times n \times n$. The number of smaller cubes on the outer surface is given by $\underbrace{2n^2}_{\text{Cover two opposite sides}} + \underbrace{2n(n-2)}_{\text{Cover next pair of opposite sides}} + \underbrace{2(n-2)^2}_{\text{Cover the remaining pair of opposite sides}}$

0

the total count of cubes increases as more and more cubes are added around an existing cube. each "level" is defined as completing the addition of an entire layer of concentric cubes that surround the previous level.

level 0 is no cubes at all

level 1 is ONE cube

level 2 surrounds level 1 with 8 more, 9 total cubes in each of 3 planes, total = 27

level 3 surr the 9 in l-2 /w 16 more, total 25 cubes in each of 5 planes, total = 125

level 4 surr the 25 in l-3 /w 24 more, total 49 cubes in each of 7 planes, total = 343

level 5 surr the 49 in l-4 /w 32 more, total 81 cubes in each of 9 planes, total = 729

etc...

these numbers, 0, 1, 27, 125, 343, 729 each represent the total count of cubes at any given concentric level. let us call this CC_T_n which stands for the Count of Cubes _ Total _ at level n.

i figured out that:

CC_T_n = ((n * 2) - 1) ^ 3

we are interested in the count of cubes required to surround a smaller block of cubes; EXACTLY what i'm doin' right here! let us call this CC_OL_n which stands for the Count of Cubes _ Outer Layer _ at level n.

if you think about it, this will equal the total count of cubes in any block at level n minus the total count of cubes in the block at level n - 1; why? because, the total count at level n - 1 is the count of blocks that the count at level n must cover!

and so, CC_OL_n = CC_T_n - CC_T_n-1, which equals:

(((n * 2) - 1) ^ 3) - ((((n - 1) * 2) - 1) ^ 3)

working this though the consecutive levels, i got the following results:

l-0 CC_T_0 = 0

l-1 CC_T_1 = 1, CC_OL_1 = 1

l-2 CC_T_2 = 27, CC_OL_2 = 26

l-3 CC_T_3 = 125, CC_OL_3 = 98

l-4 CC_T_4 = 343, CC_OL_4 = 218

l-5 CC_T_5 = 729, CC_OL_5 = 386

l-6 CC_T_6 = 1331, CC_OL_6 = 602

l-7 CC_T_7 = 2197, CC_OL_7 = 866

etc...

i typed the following string into google:

1,26,98,218,386,602,866

and i found a web site that categorizes various numeric sequences. it had a reference to a guy named Xavier Acloque with a comment "Numbers of cubes needed to completely "cover" another cube."

marty wollner thetruth-machine.com