Skip to main content

Timeline for Covering a Cube with a Square

Current License: CC BY-SA 4.0

14 events
when toggle format what by license comment
S Mar 29, 2019 at 9:22 history suggested Glorfindel CC BY-SA 4.0
broken image fixed (click 'rendered output' or 'side-by-side' to see the difference; image retrieved via Wayback Machine); for more info, see https://meta.mathoverflow.net/a/4058/70594
Mar 29, 2019 at 8:07 review Suggested edits
S Mar 29, 2019 at 9:22
Mar 10, 2017 at 9:42 history edited CommunityBot
replaced http://www.math.psu.edu/ with https://www.math.psu.edu/
May 4, 2012 at 15:54 comment added Joseph O'Rourke Still, a very nice answer to that other question!
May 4, 2012 at 2:53 history edited Anton Petrunin CC BY-SA 3.0
added 174 characters in body
May 4, 2012 at 2:42 comment added Anton Petrunin Sorry I did not read it carefully. I will make a remark about that.
May 3, 2012 at 23:17 comment added Joseph O'Rourke @Anton: I apologize for being so dense, but it may be that you are answering a different question than I asked...? I asked for how to cut up one square to cover a cube, not how to cover a cube with many squares. If I've diagnosed this correctly (unsure), it may explain why we seem to be talking past one another?
May 3, 2012 at 19:35 comment added Anton Petrunin @Joseph: the partition into faces (the cube has 6 faces).
May 3, 2012 at 19:21 comment added Joseph O'Rourke @Anton: Sorry to be slow :-/, but could you describe a partition of the square into 6 pieces that exactly cover the cube?
May 3, 2012 at 18:56 history edited Anton Petrunin CC BY-SA 3.0
added 124 characters in body
May 3, 2012 at 18:33 comment added Anton Petrunin Yes, $k$ has to be positive; so $n\ge 1$ and $m\ge 0$.
May 3, 2012 at 18:03 comment added Joseph O'Rourke @Anton: Did you intend $n \ge 1 , m \ge 1$, or, say, $n \ge 1 , m \ge 0$ ?
May 3, 2012 at 15:02 history edited Anton Petrunin CC BY-SA 3.0
added 4 characters in body
May 3, 2012 at 14:56 history answered Anton Petrunin CC BY-SA 3.0