Abstract
This paper is inspired by very interesting YouTube video of Burkard Polster, professor of mathematics at Monash University in Melbourne, Australia, which, among other things, concerned the number of ways to fill a part of the plane with dominoes, i.e. 1×2 rectangles. First we deal with the numbers of fillings the 2×2×n prism with elementary 1×1×2 prisms for n=1,2,3,4,5. Special symbolism and figures showing the filling of the prism are used as well as the concept of matching from graph theory and the corresponding graph diagrams. Then we generalize these specific considerations and derive a general recurrence formula for any n≥3, which expresses the number of fillings of the 2×2×n prism with 1×1×2 elementary prisms, which in a way can be considered as spatial domino cubes, if we do not consider their marking with pairs of numbers from 0 to 6.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
