Consider the 2 dimensional case. If this is true in 3 dimensions then it works in 2 dimensions too for partitions of a square (a cross section of the cube will be a partition of the square with the same property). Now (under the assumption that a partition exists with no two squares the same size) consider the left side of the square and the smallest square of the partition that touches that side. You know that an edge of this square must be less than half the size of the whole square, or it must be equal to the size of the whole square (why?). Discarding that second case for now because it is a trivial partition, consider the rightmost edge of this smallest square. How can you re-apply the same argument to this edge? Where does re-applying the argument a large number of times lead you?