2008 iTest Problems/Problem 25

Revision as of 23:53, 5 August 2018 by Rockmanex3 (talk | contribs) (Solution to Problem 25)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

A cube has edges of length $120$ cm. The cube gets chopped up into some number of smaller cubes, all of equal size, such that each edge of one of the smaller cubes has an integer length. One of those smaller cubes is then chopped up into some number of even smaller cubes, all of equal size. If the edge length of one of those even smaller cubes is $n$ cm, where $n$ is an integer, find the number of possible values of $n$.

Solution

The prime factorization of $120$ is $2^3 \cdot 3 \cdot 5.$ Note that $n$ must be an integer, and since the cube is chopped up into smaller cubes of integral length, $n$ must be one of the $4 \cdot 2 \cdot 2 = 16$ factors of $120$. However, since the cube is divided twice, we have to divide 120 by two numbers greater than $1,$ so the numbers $120, 60, 40,$ and $24$ would not work. Thus, there are $16 - 4 = \boxed{12}$ possible values of $n$.

See Also

2008 iTest (Problems)
Preceded by:
Problem 24
Followed by:
Problem 26
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
Invalid username
Login to AoPS