Least amount of identical (n)x(n+1) tiles to perfectly cover a 7x7 floor with two irregular tiles – puzzling.stackexchange.com

What is the least amount, $\mathscr{L}$, of $(n)\times(n+1)$ tiles that can perfectly cover a $7\times 7$ floor of unit tiles, $\hskip2in$, while still using these two pieces: $\hskip2in$ ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Google Facebook Twitter More

• Digg
• Linkedin
• Stumbleupon
• Delicious
• Tumblr
• BufferApp
• Pocket
• Evernote

Unknown