Prove that it is impossible to dissect a cube into finitely many cubes, no two of which are the same size

Answer and Step-by-step explanation:

Theoretically,

[Assuming a given Cube, C]

Suppose that dissection is possible.

Then, make the horizontal base to be a face of C. Divide the base into a perfect squared rectangle, R by the cube that are resting on it.

Each corner square of R has a smaller adjacent edge square, and the smallest edge square of R is adjacent to smaller squares that are not on the edge. Which means that the smallest square s1 in R is surrounded by larger, and thus higher, cubes on all 4 sides.

So the upper face of the cube on s1 is divided into a perfect squared square by the cubes that are resting on it.

In this dissection, let s2 be the smallest square. The sequence of squares s1, s2, s3, .... would be infinite and therefore have corresponding cubes that are in number.

This simply means dissection is not possible.

If it is possible for a 4-D hypercube to be perfectly hypercubed then it would have 'faces' that are perfect cubed cubes; but this is impossible.

Also, Cubes of higher dimensions are also impossible to be dissected.

Mathematically,

Assume that it is possible to represent a cube of length k, using smaller cubes and that the maximum number of smaller cubes needed to represent the larger cube to be is n.

In that case then, the total volume would be given in this expression (check the attachment) and it proved the impossibility of dissecting a cube.

the correct answer is 1.7

the answer on ed. is:

c. "the graph of f(x) has exactly two x-intercepts."

hope i could someone! : )