Find the Largest Cube Volume on n x n Paper

  • Context: Undergrad 
  • Thread starter Thread starter recon
  • Start date Start date
  • Tags Tags
    Cube Volume
Click For Summary

Discussion Overview

The discussion revolves around the problem of maximizing the volume of a cube that can be constructed from a net drawn on a square piece of paper measuring n by n. Participants explore various configurations for laying out the net, considering both continuous and non-continuous designs.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant suggests that drawing the net along the diagonal of the square paper may yield the largest volume, though they acknowledge that common sense may not always lead to the correct answer.
  • Another participant calculates that using the diagonal results in squares with a side length of approximately 0.247n, arguing that a horizontal or vertical layout would provide a better side length of 0.25n.
  • A different perspective is offered that questions the necessity of a continuous net, proposing alternative configurations, such as a 'z' shape, which might be more efficient.
  • Further calculations indicate that if the net does not need to be continuous, a maximum side length of approximately 0.4n could be achieved, with a side length of about 0.35n possible through a specific 'X' configuration, though this requires splitting one of the cube's faces into four pieces.
  • One participant references Martin Gardner's work, suggesting that the problem has been discussed in literature, but does not provide a proof for their claims.

Areas of Agreement / Disagreement

Participants express differing views on the optimal configuration for the net, with no consensus reached on the best approach to maximize the cube's volume. Multiple competing ideas and calculations are presented without resolution.

Contextual Notes

Some calculations depend on assumptions about the continuity of the net and the specific configurations used, which may not have been fully explored or proven within the discussion.

recon
Messages
399
Reaction score
1
If I were to draw a complete, continuous net of a cube on a piece of paper measuring n by n, how can I proceed so that the resulting cube has the largest possible volume achievable from that paper size?

I know that the most obvious solution (at least to me) is to draw the net along a diagonal of the square piece of paper (meaning that some lines forming the net will be parallel to the diagonal, and others perpendicular). However, I've been in the world long enough to know that common sense does not usually dictate the right answer.
 
Mathematics news on Phys.org
If I calculated correctly, drawing the net along the diagonal will give squares with length:

[tex]\left(\frac{\sqrt 2}{4+\sqrt 3}\right) n \approx 0.247 n[/tex]

which means you're better off taking the net horizontally or vertically, since then the length will be n/4=0.25n.
 
Are you stuck with that particular net? There are other ways to build a cube from a flat piece of paper that might be more efficient. One way lays the squares out as mroe of a 'z' than a 't'.


P.S. I am an old, old man - in my thirtes at least. When I was young, there was no such thing as a 'net'. I was helping edit an elementary schoolbook last year, and the editor and I both came upon this word we had never encountered before. How it's in elementary schools? When did it get introduced?
 
Galileo said:
If I calculated correctly, drawing the net along the diagonal will give squares with length:

[tex]\left(\frac{\sqrt 2}{4+\sqrt 3}\right) n \approx 0.247 n[/tex]

which means you're better off taking the net horizontally or vertically, since then the length will be n/4=0.25n.

If you don't need the net to be continuous, the maximum side length is going to be
[tex]\frac{n}{\sqrt{6}} \approx .4 n[/tex]
It's possible to get a side length of
[tex]\frac{n}{2\sqrt{2}} \approx .35n[/tex]
if the net forms an 'X' diagonally across the square piece of paper, but it involves splitting one of the faces into four pieces. That's likely to be optimal, but I don't have a proof handy. Martin Gardner discusses this problem in one of his books.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 40 ·
2
Replies
40
Views
6K
  • · Replies 1 ·
Replies
1
Views
3K