Talk:Domino (mathematics)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
WikiProject Mathematics (Rated Start-class, Low-importance)
WikiProject Mathematics
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
Start Class
Low Importance
 Field:  Discrete mathematics

Tilings of a 2×n rectangle

I seem to recall that the number of tilings of a 2×n rectangle with dominoes is , the nth Fibonacci number; this problem appears in Concrete Mathematics, by Graham, Knuth, and Patashnik. Is this sufficiently notable to be mentioned? —Dominus (talk) 08:11, 26 October 2009 (UTC)

Interesting one. Add it if you can source it. --ἀνυπόδητος (talk) 08:27, 26 October 2009 (UTC)
Young–Fibonacci lattice, Fibonacci number#Identities. — Miym (talk) 20:16, 26 October 2009 (UTC)
Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Talk:Domino (mathematics)"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA