-- Now we need to tie these functions together.

-- What is the total number of tiles, t, that equals twoTiles n2, threeTiles n3,
-- ... etc all of which are modulo 1 to their respective widths n2, n3, etc,
-- and are modulo 0 to depth of seven, n7?

{--
But let's think about this problem for a second! 

1. we need modulo7 == 0 in all cases
2. we have 8 corners??? really??? 

Eh, let's just say we're decorating n corners, instead with 2,3,...7 tiles
and go from there.

That means we have 7,14,21, etc tiles.

Let's do this. Let's work from a total number of tiles and work backwards.

.. Also we know even numbers are out (mod 2 == 0) so we can just skip those:
--}

totalTiles :: [Int]
totalTiles = filter mod1ForEverything (map (*7) [1,3 ..])
totalTiles :: [Int]
totalTiles = filter mod1ForEverything (map (*7) [1,3 ..])
totalTiles = filter mod1ForEverything (map (*7) [1,3 ..])