Skip to main content
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
Source Link

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />k=30
(source: psu.edu)

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

k=30
(source: psu.edu)

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

replaced http://www.math.psu.edu/ with https://www.math.psu.edu/
Source Link

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$.

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

added 174 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Q2Question: Iff For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$. 

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Q2: Iff $k=6\cdot(n^2+m^2)$. Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

Sorry, this is an answer to an other question. (I did not read the question carefully.)

Question: For which $k$, $k$ squares can tile the surface of cube.

Answer: $k=6\cdot(n^2+m^2)$. 

Here is a tiling with $k=30$, $n=1$ and $m=2$.

<span class=$k=30$." />

It is obvious if the tiling is vertex-to-vertex.

If the tiling is not vertex-to-vertex, you get a closed geodesic formed by overlaping sides. Then you can shift squares on one side of the geodesic to make the tiling "more vertex-to-vertex". Repeating this operation you can make the tiling to be vertex-to-vertex.

added 124 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299
Loading
added 4 characters in body
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299
Loading
Source Link
Anton Petrunin
  • 45k
  • 14
  • 135
  • 299
Loading