In my previous post I made images like this:

What’s going on? Well, first, it’s easy to notice that each grid starts with in the upper-left square; is one square down and to the right of , then is one square down and to the right of , and so on….

When we get to an edge, we “wrap around” from the bottom to the top and/or from the right to the left. For example, in the grid above, notice how the is still one space to the right of the , but in the top row; likewise, the is below the but in the left column; then the immediately wraps back around to the top row, and so on.

In other words, we can imagine that we are really making a straight diagonal line, but the bottom edge of the grid is “glued” to the top edge, and the right edge is glued to the left edge (making a torus, aka donut).

Equivalently, we can imagine gluing a bunch of copies of the grid together along their edges, and the numbers just count in a straight diagonal line, moving from one grid to the next, like this:

Although really, since each grid is supposed to be a copy, we should draw a diagonal sequence of numbers starting at in the upper-left corner of every copy!

So in this particular example, if we keep doing this, we eventually fill up the entire grid/space:

But sometimes that doesn’t happen; for example:

In this example, when we get to the in the bottom-right corner, we would have to wrap around to the top left again, but the is already there. So the process stops before we actually fill up the whole grid. This is why some of the grids have empty spaces in them. Here’s another slightly more interesting example:

So, what’s the difference? How can you tell whether a particular grid is going to fill up or have empty spaces left over?

### Like this:

Like Loading...

*Related*

##
About Brent

Assistant Professor of Computer Science at Hendrix College. Functional programmer, mathematician, teacher, pianist, follower of Jesus.

CRT?

Yes, that’s exactly where I’m going with this. =)

Looks to me like the grid will be filled if and only if its dimensions are coprime, thus forming an irreducible ratio. If the l:h ratio is reducible, the diagonal will run into itself before it can wrap around onto all tiles.

Pingback: More words about PWW #25: The Chinese Remainder Theorem | The Math Less Traveled