Prince Rupert's cube

Last updated

A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass Prince Ruperts cube.png
A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass

In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into two pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution.

Contents

Prince Rupert's cube is named after Prince Rupert of the Rhine, who asked whether a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces. A positive answer was given by John Wallis. Approximately 100 years later, Pieter Nieuwland found the largest possible cube that can pass through a hole in a unit cube.

Many other convex polyhedra, including all five Platonic solids, have been shown to have the Rupert property: a copy of the polyhedron, of the same or larger shape, can be passed through a hole in the polyhedron. It is unknown whether this is true for all convex polyhedra.

Solution

A trimetric projection of a cube with unit side length with selected dimensions labelled - the green dash-dot line shows a unit square (cross-section of a unit cube) in the hole (blue dashed line) Prince Rupert cube.svg
A trimetric projection of a cube with unit side length with selected dimensions labelled – the green dash-dot line shows a unit square (cross-section of a unit cube) in the hole (blue dashed line)

Place two points on two adjacent edges of a unit cube, each at a distance of 3/4 from the point where the two edges meet, and two more points symmetrically on the opposite face of the cube. Then these four points form a square with side length

One way to see this is to first observe that these four points form a rectangle, by the symmetries of their construction. The lengths of all four sides of this rectangle equal , by the Pythagorean theorem or (equivalently) the formula for Euclidean distance in three dimensions. For instance, the first two points, together with the third point where their two edges meet, form an isosceles right triangle with legs of length , and the distance between the first two points is the hypotenuse of the triangle. As a rectangle with four equal sides, the shape formed by these four points is a square. Extruding the square in both directions perpendicularly to itself forms the hole through which a cube larger than the original one, up to side length , may pass. [1]

The parts of the unit cube that remain, after emptying this hole, form two triangular prisms and two irregular tetrahedra, connected by thin bridges at the four vertices of the square. Each prism has as its six vertices two adjacent vertices of the cube, and four points along the edges of the cube at distance 1/4 from these cube vertices. Each tetrahedron has as its four vertices one vertex of the cube, two points at distance 3/4 from it on two of the adjacent edges, and one point at distance 3/16 from the cube vertex along the third adjacent edge. [2]

A unit cube with a hole cut through it (3D model) Prince Rupert's cube.stl
A unit cube with a hole cut through it (3D model)

History

Prince Rupert's cube is named after Prince Rupert of the Rhine. According to a story recounted in 1693 by English mathematician John Wallis, Prince Rupert wagered that a hole could be cut through a cube, large enough to let another cube of the same size pass through it. Wallis showed that in fact such a hole was possible (with some errors that were not corrected until much later), and Prince Rupert won his wager. [3] [4]

Wallis assumed that the hole would be parallel to a space diagonal of the cube. The projection of the cube onto a plane perpendicular to this diagonal is a regular hexagon, and the best hole parallel to the diagonal can be found by drawing the largest possible square that can be inscribed into this hexagon. Calculating the size of this square shows that a cube with side length

,

slightly larger than one, is capable of passing through the hole. [3]

Approximately 100 years later, Dutch mathematician Pieter Nieuwland found that a better solution may be achieved by using a hole with a different angle than the space diagonal. In fact, Nieuwland's solution is optimal. Nieuwland died in 1794, a year after taking a position as a professor at the University of Leiden, and his solution was published posthumously in 1816 by Nieuwland's mentor, Jean Henri van Swinden. [3] [4] [5]

Since then, the problem has been repeated in many books on recreational mathematics, in some cases with Wallis' suboptimal solution instead of the optimal solution. [1] [2] [6] [7] [8] [9] [10] [11] [12]

Models

3D-printed Prince Rupert's Cube with 1:1 ratio of inner cube to outer cube. 3D-printed Prince Rupert Cube.jpg
3D-printed Prince Rupert's Cube with 1:1 ratio of inner cube to outer cube.

The construction of a physical model of Prince Rupert's cube is made challenging by the accuracy with which such a model needs to be measured, and the thinness of the connections between the remaining parts of the unit cube after the hole is cut through it. For the maximally sized inner cube with length ≈1.06 relative to the length 1 outer cube, constructing a model is "mathematically possible but practically impossible". [13] On the other hand, using the orientation of the maximal cube but making a smaller hole, big enough only for a unit cube, leaves additional thickness that allows for structural integrity. [14]

For the example using two cubes of the same size, as originally proposed by Prince Rupert, model construction is possible. In a 1950 survey of the problem, D. J. E. Schrek published photographs of a model of a cube passing through a hole in another cube. [15] Martin Raynsford has designed a template for constructing paper models of a cube with another cube passing through it; however, to account for the tolerances of paper construction and not tear the paper at the narrow joints between parts of the punctured cube, the hole in Raynsford's model only lets cubes through that are slightly smaller than the outer cube. [16]

Since the advent of 3D printing, construction of a Prince Rupert cube of the full 1:1 ratio has become easy. [17]

Generalizations

A polyhedron is said to have the Rupert property if a polyhedron of the same or larger size and the same shape as can pass through a hole in . [18] All five Platonic solids—the cube, regular tetrahedron, regular octahedron, [19] regular dodecahedron, and regular icosahedron—have the Rupert property. Of the 13 Archimedean solids, it is known that at least these ten have the Rupert property: the cuboctahedron, truncated octahedron, truncated cube, rhombicuboctahedron, icosidodecahedron, truncated cuboctahedron, truncated icosahedron, truncated dodecahedron, [20] and the truncated tetrahedron [21] [22] , as well as the truncated icosidodecahedron [23] [24] . It has been conjectured that all 3-dimensional convex polyhedra have this property [18] , but also, to the contrary, that the rhombicosidodecahedron does not have Rupert's property [23] [24] .

Unsolved problem in mathematics:

Do all convex polyhedra have the Rupert property?

(more unsolved problems in mathematics)

Cubes and all rectangular solids have Rupert passages in every direction that is not parallel to any of their faces. [25]

Another way to express the same problem is to ask for the largest square that lies within a unit cube. More generally, Jerrard & Wetzel (2004) show how to find the largest rectangle of a given aspect ratio that lies within a unit cube. As they observe, the optimal rectangle must always be centered at the center of the cube, with its vertices on edges of the cube. Depending on its aspect ratio, the ratio between its long and short sides, there are two cases for how it can be placed within the cube. For an aspect ratio of or more, the optimal rectangle lies within the rectangle connecting two opposite edges of the cube, which has aspect ratio exactly . For aspect ratios closer to 1 (including aspect ratio 1 for the square of Prince Rupert's cube), two of the four vertices of an optimal rectangle are equidistant from a vertex of the cube, along two of the three edges touching that vertex. The other two rectangle vertices are the reflections of the first two across the center of the cube. [4] If the aspect ratio is not constrained, the rectangle with the largest area that fits within a cube is the one of aspect ratio that has two opposite edges of the cube as two of its sides, and two face diagonals as the other two sides. [26]

For all , the -dimensional hypercube also has the Rupert property. [27] Moreover, one may ask for the largest -dimensional hypercube that may be drawn within an -dimensional unit hypercube. The answer is always an algebraic number. For instance, the problem for asks for the largest (three-dimensional) cube within a four-dimensional hypercube. After Martin Gardner posed this question in Scientific American , Kay R. Pechenick DeVicci and several other readers showed that the answer for the (3,4) case is the square root of the smaller of two real roots of the polynomial , which works out to approximately 1.007435. [1] [28] For , the optimal side length of the largest square in an -dimensional hypercube is either or , depending on whether is even or odd respectively. [29]

Related Research Articles

<span class="mw-page-title-main">Cuboctahedron</span> Polyhedron with 8 triangular faces and 6 square faces

A cuboctahedron is a polyhedron with 8 triangular faces and 6 square faces. A cuboctahedron has 12 identical vertices, with 2 triangles and 2 squares meeting at each, and 24 identical edges, each separating a triangle from a square. As such, it is a quasiregular polyhedron, i.e. an Archimedean solid that is not only vertex-transitive but also edge-transitive. It is radially equilateral.

<span class="mw-page-title-main">Cube</span> Solid object with six equal square faces

In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets, or sides, with three meeting at each vertex. Viewed from a corner, it is a hexagon and its net is usually depicted as a cross.

<span class="mw-page-title-main">Regular icosahedron</span> Polyhedron with 20 regular triangular faces

In geometry, the regular icosahedron is a convex polyhedron that can be constructed from pentagonal antiprism by attaching two pentagonal pyramids with regular faces to each of its pentagonal faces, or by putting points onto the cube. The resulting polyhedron has 20 equilateral triangles as its faces, 30 edges, and 12 vertices. It is an example of the Platonic solid and of the deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron.

<span class="mw-page-title-main">Octahedron</span> Polyhedron with eight triangular faces

In geometry, an octahedron is a polyhedron with eight faces. The term is most commonly used to refer to the regular octahedron, a Platonic solid composed of eight equilateral triangles, four of which meet at each vertex.

In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent regular polygons, and the same number of faces meet at each vertex. There are only five such polyhedra:

<span class="mw-page-title-main">Rhombicuboctahedron</span> Archimedean solid with 26 faces

In geometry, the rhombicuboctahedron, or small rhombicuboctahedron, is a polyhedron with eight triangular, six square, and twelve rectangular faces. There are 24 identical vertices, with one triangle, one square, and two rectangles meeting at each one. If all the rectangles are themselves square, it is an Archimedean solid. The polyhedron has octahedral symmetry, like the cube and octahedron. Its dual is called the deltoidal icositetrahedron or trapezoidal icositetrahedron, although its faces are not really true trapezoids.

<span class="mw-page-title-main">Tesseract</span> Four-dimensional analogue of the cube

In geometry, a tesseract or 4-cube is a four-dimensional hypercube, analogous to a two-dimensional square and a three-dimensional cube. Just as the perimeter of the square consists of four edges and the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells, meeting at right angles. The tesseract is one of the six convex regular 4-polytopes.

In geometry, a cuboid is a hexahedron, a six-faced solid. Its faces are quadrilaterals. Cuboid means "like a cube", in the sense that by adjusting the lengths of the edges or the angles between faces, a cuboid can be transformed into a cube. In mathematical language a cuboid is a convex polyhedron whose polyhedral graph is the same as that of a cube.

<span class="mw-page-title-main">Snub cube</span> Archimedean solid with 38 faces

In geometry, the snub cube, or snub cuboctahedron, is an Archimedean solid with 38 faces: 6 squares and 32 equilateral triangles. It has 60 edges and 24 vertices.

<span class="mw-page-title-main">Packing problems</span> Problems which attempt to find the most efficient way to pack objects into containers

Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.

<span class="mw-page-title-main">Truncated octahedron</span> Archimedean solid

In geometry, the truncated octahedron is the Archimedean solid that arises from a regular octahedron by removing six pyramids, one at each of the octahedron's vertices. The truncated octahedron has 14 faces, 36 edges, and 24 vertices. Since each of its faces has point symmetry the truncated octahedron is a 6-zonohedron. It is also the Goldberg polyhedron GIV(1,1), containing square and hexagonal faces. Like the cube, it can tessellate 3-dimensional space, as a permutohedron.

<span class="mw-page-title-main">Truncated cube</span> Archimedean solid with 14 regular faces

In geometry, the truncated cube, or truncated hexahedron, is an Archimedean solid. It has 14 regular faces, 36 edges, and 24 vertices.

<span class="mw-page-title-main">Prism (geometry)</span> Solid with 2 parallel n-gonal bases connected by n parallelograms

In geometry, a prism is a polyhedron comprising an n-sided polygon base, a second base which is a translated copy of the first, and n other faces, necessarily all parallelograms, joining corresponding sides of the two bases. All cross-sections parallel to the bases are translations of the bases. Prisms are named after their bases, e.g. a prism with a pentagonal base is called a pentagonal prism. Prisms are a subclass of prismatoids.

<span class="mw-page-title-main">Rhombicosidodecahedron</span> Archimedean solid

In geometry, the rhombicosidodecahedron is an Archimedean solid, one of thirteen convex isogonal nonprismatic solids constructed of two or more types of regular polygon faces.

<span class="mw-page-title-main">Truncated cuboctahedron</span> Archimedean solid in geometry

In geometry, the truncated cuboctahedron or great rhombicuboctahedron is an Archimedean solid, named by Kepler as a truncation of a cuboctahedron. It has 12 square faces, 8 regular hexagonal faces, 6 regular octagonal faces, 48 vertices, and 72 edges. Since each of its faces has point symmetry, the truncated cuboctahedron is a 9-zonohedron. The truncated cuboctahedron can tessellate with the octagonal prism.

<span class="mw-page-title-main">Tetrakis hexahedron</span> Catalan solid with 24 faces

In geometry, a tetrakis hexahedron is a Catalan solid. Its dual is the truncated octahedron, an Archimedean solid.

In geometry, a truncated tesseract is a uniform 4-polytope formed as the truncation of the regular tesseract.

<span class="mw-page-title-main">Regular dodecahedron</span> Polyhedron with 12 regular pentagonal faces

A regular dodecahedron or pentagonal dodecahedron is a dodecahedron that is regular, which is composed of 12 regular pentagonal faces, three meeting at each vertex. It is one of the five Platonic solids. It has 12 faces, 20 vertices, 30 edges, and 160 diagonals. It is represented by the Schläfli symbol {5,3}.

<span class="mw-page-title-main">Truncated 5-cubes</span>

In five-dimensional geometry, a truncated 5-cube is a convex uniform 5-polytope, being a truncation of the regular 5-cube.

In six-dimensional geometry, a truncated 6-cube is a convex uniform 6-polytope, being a truncation of the regular 6-cube.

References

  1. 1 2 3 Gardner, Martin (2001), The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems : Number Theory, Algebra, Geometry, Probability, Topology, Game Theory, Infinity, and Other Topics of Recreational Mathematics, W. W. Norton & Company, pp. 172–173, ISBN   9780393020236
  2. 1 2 Wells, David (1997), The Penguin Dictionary of Curious and Interesting Numbers (3rd ed.), Penguin, p. 16, ISBN   9780140261493
  3. 1 2 3 Rickey, V. Frederick (2005), Dürer's Magic Square, Cardano's Rings, Prince Rupert's Cube, and Other Neat Things (PDF), archived from the original (PDF) on 2010-07-05; notes for “Recreational Mathematics: A Short Course in Honor of the 300th Birthday of Benjamin Franklin,” Mathematical Association of America, Albuquerque, NM, August 2–3, 2005
  4. 1 2 3 Jerrard, Richard P.; Wetzel, John E. (2004), "Prince Rupert's rectangles", The American Mathematical Monthly, 111 (1): 22–31, doi:10.2307/4145012, JSTOR   4145012, MR   2026310
  5. ↑ Swinden, J. H. Van (1816), Grondbeginsels der Meetkunde (in Dutch) (2nd ed.), Amsterdam: P. den Hengst en zoon, pp. 512–513
  6. ↑ Ozanam, Jacques (1803), Montucla, Jean Étienne; Hutton, Charles (eds.), Recreations in Mathematics and Natural Philosophy: Containing Amusing Dissertations and Enquiries Concerning a Variety of Subjects the Most Remarkable and Proper to Excite Curiosity and Attention to the Whole Range of the Mathematical and Philosophical Sciences, G. Kearsley, pp. 315–316
  7. ↑ Dudeney, Henry Ernest (1936), Modern puzzles and how to solve them, p. 149
  8. ↑ Ogilvy, C. Stanley (1956), Through the Mathescope, Oxford University Press, pp. 54–55. Reprinted as Ogilvy, C. Stanley (1994), Excursions in mathematics, New York: Dover Publications Inc., ISBN   0-486-28283-X, MR   1313725
  9. ↑ Ehrenfeucht, Aniela (1964), The Cube Made Interesting, translated by Zawadowski, Wacław, New York: The Macmillan Co., p. 77, MR   0170242
  10. ↑ Stewart, Ian (2001), Flatterland: Like Flatland Only More So , Macmillan, pp. 49–50, ISBN   9780333783122
  11. ↑ Darling, David (2004), The Universal Book of Mathematics: From Abracadabra to Zeno's Paradoxes, John Wiley & Sons, p. 255, ISBN   9780471667001
  12. ↑ Pickover, Clifford A. (2009), The Math Book: From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics, Sterling Publishing Company, Inc., p. 214, ISBN   9781402757969
  13. ↑ Sriraman, Bharath (2009), "Mathematics and literature (the sequel): imagination as a pathway to advanced mathematical ideas and philosophy", in Sriraman, Bharath; Freiman, Viktor; Lirette-Pitre, Nicole (eds.), Interdisciplinarity, Creativity, and Learning: Mathematics With Literature, Paradoxes, History, Technology, and Modeling, The Montana Mathematics Enthusiast: Monograph Series in Mathematics Education, vol. 7, Information Age Publishing, Inc., pp. 41–54, ISBN   9781607521013
  14. ↑ Parker, Matt (2015), Things to Make and Do in the Fourth Dimension: A Mathematician's Journey Through Narcissistic Numbers, Optimal Dating Algorithms, at Least Two Kinds of Infinity, and More, New York: Farrar, Straus and Giroux, p. 98, ISBN   978-0-374-53563-6, MR   3753642
  15. ↑ Schrek, D. J. E. (1950), "Prince Rupert's problem and its extension by Pieter Nieuwland", Scripta Mathematica , 16: 73–80 and 261–267; as cited by Rickey (2005) and Jerrard & Wetzel (2004)
  16. ↑ Hart, George W. (January 30, 2012), Math Monday: Passing a Cube Through Another Cube, Museum of Mathematics; originally published in Make Online
  17. ↑ 3geek14, Prince Rupert's Cube, Shapeways, retrieved 2017-02-06{{citation}}: CS1 maint: numeric names: authors list (link)
  18. 1 2 Jerrard, Richard P.; Wetzel, John E.; Yuan, Liping (April 2017), "Platonic passages", Mathematics Magazine , Washington, DC: Mathematical Association of America, 90 (2): 87–98, doi:10.4169/math.mag.90.2.87, S2CID   218542147
  19. ↑ Scriba, Christoph J. (1968), "Das Problem des Prinzen Ruprecht von der Pfalz", Praxis der Mathematik (in German), 10 (9): 241–246, MR   0497615
  20. ↑ Chai, Ying; Yuan, Liping; Zamfirescu, Tudor (June–July 2018), "Rupert Property of Archimedean Solids", The American Mathematical Monthly , 125 (6): 497–504, doi:10.1080/00029890.2018.1449505, S2CID   125508192
  21. ↑ Hoffmann, Balazs (2019), "Rupert properties of polyhedra and the generalized Nieuwland constant", Journal for Geometry and Graphics, 23 (1): 29–35
  22. ↑ Lavau, Gérard (December 2019), "The Truncated Tetrahedron is Rupert", The American Mathematical Monthly , 126 (10): 929–932, doi:10.1080/00029890.2019.1656958, S2CID   213502432
  23. 1 2 Steininger, Jakob; Yurkevich, Sergey (2022), "Extended Abstract for: Solving Rupert's Problem Algorithmically" (PDF), ACM Commun. Comput. Algebra, 56 (2): 32–35, doi:10.1145/3572867.3572870, S2CID   253802715
  24. 1 2 Steininger, Jakob; Yurkevich, Sergey (2023), "An algorithmic approach to Rupert's problem", Mathematics of Computation , 92 (342): 1905–1929, arXiv: 2112.13754 , doi:10.1090/mcom/3831, MR   4570346
  25. ↑ Bezdek, András; Guan, Zhenyue; Hujter, Mihály; Joós, Antal (2021), "Cubes and boxes have Rupert's passages in every nontrivial direction", The American Mathematical Monthly , 128 (6): 534–542, arXiv: 2111.03817 , doi:10.1080/00029890.2021.1901461, MR   4265479, S2CID   235234134
  26. ↑ Thompson, Silvanus P.; Gardner, Martin (1998), Calculus Made Easy (3rd ed.), Macmillan, p. 315, ISBN   9780312185480
  27. ↑ Huber, Greg; Shultz, Kay Pechenick; Wetzel, John E. (June–July 2018), "The n-cube is Rupert", The American Mathematical Monthly , 125 (6): 505–512, doi:10.1080/00029890.2018.1448197, S2CID   51841349
  28. ↑ Guy, Richard K.; Nowakowski, Richard J. (1997), "Unsolved Problems: Monthly Unsolved Problems, 1969-1997", The American Mathematical Monthly , 104 (10): 967–973, doi:10.2307/2974481, JSTOR   2974481, MR   1543116
  29. ↑ Weisstein, Eric W., "Cube Square Inscribing", MathWorld
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.