長方體中切割正立方體之研究
我們這個作品是先由在長方形中切割出正方形的研究著手,先研究出在平面中,在一個邊長為任意正整數的長方形中,如何找到在其中切割出正方形,但正方形的邊長為最大,而且正方形的個數為最少的方法和規則。 緊接著,我們更進一步想研究這個問題在長方體中的研究:在長方體三邊長a、b、c(a、b、c均為正整數)中,如何在其中切割出正立方體,每次切割出邊長為最大的正立方體,而且正方體的個數為最少的方法和規則。 This study began with investigation of how to segment squares from a rectangle. We studied from a rectangle, with random positive integer sides, trying to figure out the methods and regulations to segments squares with the longest side length but the fewest number of squares within. Moreover, we took further step to examine a cuboid. We found out the methods and regulations to segment cubes with longest side length but fewest number of cubes from a cuboid with sides a, b, and c(a ,b ,c are positive integers).