In how many ways can a $ 2 times n $ rectangle be tiled by $ 2 times 1 $ or $ 1 times 1 $ tiles?












2












$begingroup$


This problem is from the book "Problem Solving Strategies" by Arthur Engel (Chapter 9, problem 64) and the solution given there is $ a_0 = 1, a_1 = 2, a_2 = 7$ and the recurrence relation being $ a_n = 3a_{n-1} + a_{n-2} - a_{n-3}$

I'd like to know how did we get this recurrence.






sequences-and-series combinatorics recurrence-relations tiling







share|cite|improve this question











$endgroup$












  • $begingroup$
    @RossMillikan my bad, sorry for not writing the question properly.
    $endgroup$
    – Shafin Ahmed
    Dec 13 '18 at 17:30
















2












$begingroup$


This problem is from the book "Problem Solving Strategies" by Arthur Engel (Chapter 9, problem 64) and the solution given there is $ a_0 = 1, a_1 = 2, a_2 = 7$ and the recurrence relation being $ a_n = 3a_{n-1} + a_{n-2} - a_{n-3}$

I'd like to know how did we get this recurrence.






sequences-and-series combinatorics recurrence-relations tiling







share|cite|improve this question











$endgroup$












  • $begingroup$
    @RossMillikan my bad, sorry for not writing the question properly.
    $endgroup$
    – Shafin Ahmed
    Dec 13 '18 at 17:30














2












2








2





$begingroup$


This problem is from the book "Problem Solving Strategies" by Arthur Engel (Chapter 9, problem 64) and the solution given there is $ a_0 = 1, a_1 = 2, a_2 = 7$ and the recurrence relation being $ a_n = 3a_{n-1} + a_{n-2} - a_{n-3}$

I'd like to know how did we get this recurrence.






sequences-and-series combinatorics recurrence-relations tiling







share|cite|improve this question











$endgroup$




This problem is from the book "Problem Solving Strategies" by Arthur Engel (Chapter 9, problem 64) and the solution given there is $ a_0 = 1, a_1 = 2, a_2 = 7$ and the recurrence relation being $ a_n = 3a_{n-1} + a_{n-2} - a_{n-3}$

I'd like to know how did we get this recurrence.






sequences-and-series combinatorics recurrence-relations tiling




sequences-and-series combinatorics recurrence-relations tiling






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 13 '18 at 17:28







Shafin Ahmed

















asked Dec 13 '18 at 17:12









Shafin AhmedShafin Ahmed

707




707












  • $begingroup$
    @RossMillikan my bad, sorry for not writing the question properly.
    $endgroup$
    – Shafin Ahmed
    Dec 13 '18 at 17:30


















  • $begingroup$
    @RossMillikan my bad, sorry for not writing the question properly.
    $endgroup$
    – Shafin Ahmed
    Dec 13 '18 at 17:30
















$begingroup$
@RossMillikan my bad, sorry for not writing the question properly.
$endgroup$
– Shafin Ahmed
Dec 13 '18 at 17:30




$begingroup$
@RossMillikan my bad, sorry for not writing the question properly.
$endgroup$
– Shafin Ahmed
Dec 13 '18 at 17:30










1 Answer
1






active

oldest

votes


















2












$begingroup$

We can define $A(n)$ as the number of ways to tile a $2 times n$ rectangle, $B(n)$ as the number of ways to tile a $2 times n$ rectangle plus one square and $C(n)$ as the number of ways to tile a $2 times n$ rectangle plus one horizontal domino. We can set up a set of coupled recurrences by imagining we add one piece that covers the leftmost uncovered square or the top one if there are two.
$$A(n)=A(n-1)+B(n-1)+C(n-2)\B(n)=A(n)+B(n-1)+C(n-1)\C(n)=A(n)$$
Because we can get a $2 times n$ rectangle by adding a vertical domino to a $2 times n-1$ rectangle or filling in the hole on the other shapes, we can get a $B$ shape by adding $1 times 1$ to a rectangle, by adding a $1 times 2$ to a B shape or by adding a $1 times 1$ to a C shape, and we can only get a C shape by adding a horizontal $1 times 2$ to a rectangle. Then we get
$$A(n)=A(n-1)+B(n-1)+A(n-2)\
B(n)=A(n)+B(n-1)+A(n-1)\
B(n-1)-B(n-2)=A(n-1)+A(n-2)\
A(n-1)=A(n-2)+B(n-2)+A(n-3)\
A(n)-A(n-1)=A(n-1)+B(n-1)-B(n-2)-A(n-3)\
A(n)=3A(n-1)+A(n-2)-A(n-3)$$



The sequence is given in OEIS A030186 and begins $$1, 2, 7, 22, 71, 228, 733, 2356, 7573, 24342, 78243, 251498, 808395, 2598440, 8352217, 26846696, 86293865, 277376074, 891575391, 2865808382, 9211624463, 29609106380, 95173135221, 305916887580, 983314691581, 3160687827102 $$

The fourth comment says this is the count of the tilings we want.






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3038311%2fin-how-many-ways-can-a-2-times-n-rectangle-be-tiled-by-2-times-1-or%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2












    $begingroup$

    We can define $A(n)$ as the number of ways to tile a $2 times n$ rectangle, $B(n)$ as the number of ways to tile a $2 times n$ rectangle plus one square and $C(n)$ as the number of ways to tile a $2 times n$ rectangle plus one horizontal domino. We can set up a set of coupled recurrences by imagining we add one piece that covers the leftmost uncovered square or the top one if there are two.
    $$A(n)=A(n-1)+B(n-1)+C(n-2)\B(n)=A(n)+B(n-1)+C(n-1)\C(n)=A(n)$$
    Because we can get a $2 times n$ rectangle by adding a vertical domino to a $2 times n-1$ rectangle or filling in the hole on the other shapes, we can get a $B$ shape by adding $1 times 1$ to a rectangle, by adding a $1 times 2$ to a B shape or by adding a $1 times 1$ to a C shape, and we can only get a C shape by adding a horizontal $1 times 2$ to a rectangle. Then we get
    $$A(n)=A(n-1)+B(n-1)+A(n-2)\
    B(n)=A(n)+B(n-1)+A(n-1)\
    B(n-1)-B(n-2)=A(n-1)+A(n-2)\
    A(n-1)=A(n-2)+B(n-2)+A(n-3)\
    A(n)-A(n-1)=A(n-1)+B(n-1)-B(n-2)-A(n-3)\
    A(n)=3A(n-1)+A(n-2)-A(n-3)$$



    The sequence is given in OEIS A030186 and begins $$1, 2, 7, 22, 71, 228, 733, 2356, 7573, 24342, 78243, 251498, 808395, 2598440, 8352217, 26846696, 86293865, 277376074, 891575391, 2865808382, 9211624463, 29609106380, 95173135221, 305916887580, 983314691581, 3160687827102 $$

    The fourth comment says this is the count of the tilings we want.






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      We can define $A(n)$ as the number of ways to tile a $2 times n$ rectangle, $B(n)$ as the number of ways to tile a $2 times n$ rectangle plus one square and $C(n)$ as the number of ways to tile a $2 times n$ rectangle plus one horizontal domino. We can set up a set of coupled recurrences by imagining we add one piece that covers the leftmost uncovered square or the top one if there are two.
      $$A(n)=A(n-1)+B(n-1)+C(n-2)\B(n)=A(n)+B(n-1)+C(n-1)\C(n)=A(n)$$
      Because we can get a $2 times n$ rectangle by adding a vertical domino to a $2 times n-1$ rectangle or filling in the hole on the other shapes, we can get a $B$ shape by adding $1 times 1$ to a rectangle, by adding a $1 times 2$ to a B shape or by adding a $1 times 1$ to a C shape, and we can only get a C shape by adding a horizontal $1 times 2$ to a rectangle. Then we get
      $$A(n)=A(n-1)+B(n-1)+A(n-2)\
      B(n)=A(n)+B(n-1)+A(n-1)\
      B(n-1)-B(n-2)=A(n-1)+A(n-2)\
      A(n-1)=A(n-2)+B(n-2)+A(n-3)\
      A(n)-A(n-1)=A(n-1)+B(n-1)-B(n-2)-A(n-3)\
      A(n)=3A(n-1)+A(n-2)-A(n-3)$$



      The sequence is given in OEIS A030186 and begins $$1, 2, 7, 22, 71, 228, 733, 2356, 7573, 24342, 78243, 251498, 808395, 2598440, 8352217, 26846696, 86293865, 277376074, 891575391, 2865808382, 9211624463, 29609106380, 95173135221, 305916887580, 983314691581, 3160687827102 $$

      The fourth comment says this is the count of the tilings we want.






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        We can define $A(n)$ as the number of ways to tile a $2 times n$ rectangle, $B(n)$ as the number of ways to tile a $2 times n$ rectangle plus one square and $C(n)$ as the number of ways to tile a $2 times n$ rectangle plus one horizontal domino. We can set up a set of coupled recurrences by imagining we add one piece that covers the leftmost uncovered square or the top one if there are two.
        $$A(n)=A(n-1)+B(n-1)+C(n-2)\B(n)=A(n)+B(n-1)+C(n-1)\C(n)=A(n)$$
        Because we can get a $2 times n$ rectangle by adding a vertical domino to a $2 times n-1$ rectangle or filling in the hole on the other shapes, we can get a $B$ shape by adding $1 times 1$ to a rectangle, by adding a $1 times 2$ to a B shape or by adding a $1 times 1$ to a C shape, and we can only get a C shape by adding a horizontal $1 times 2$ to a rectangle. Then we get
        $$A(n)=A(n-1)+B(n-1)+A(n-2)\
        B(n)=A(n)+B(n-1)+A(n-1)\
        B(n-1)-B(n-2)=A(n-1)+A(n-2)\
        A(n-1)=A(n-2)+B(n-2)+A(n-3)\
        A(n)-A(n-1)=A(n-1)+B(n-1)-B(n-2)-A(n-3)\
        A(n)=3A(n-1)+A(n-2)-A(n-3)$$



        The sequence is given in OEIS A030186 and begins $$1, 2, 7, 22, 71, 228, 733, 2356, 7573, 24342, 78243, 251498, 808395, 2598440, 8352217, 26846696, 86293865, 277376074, 891575391, 2865808382, 9211624463, 29609106380, 95173135221, 305916887580, 983314691581, 3160687827102 $$

        The fourth comment says this is the count of the tilings we want.






        share|cite|improve this answer









        $endgroup$



        We can define $A(n)$ as the number of ways to tile a $2 times n$ rectangle, $B(n)$ as the number of ways to tile a $2 times n$ rectangle plus one square and $C(n)$ as the number of ways to tile a $2 times n$ rectangle plus one horizontal domino. We can set up a set of coupled recurrences by imagining we add one piece that covers the leftmost uncovered square or the top one if there are two.
        $$A(n)=A(n-1)+B(n-1)+C(n-2)\B(n)=A(n)+B(n-1)+C(n-1)\C(n)=A(n)$$
        Because we can get a $2 times n$ rectangle by adding a vertical domino to a $2 times n-1$ rectangle or filling in the hole on the other shapes, we can get a $B$ shape by adding $1 times 1$ to a rectangle, by adding a $1 times 2$ to a B shape or by adding a $1 times 1$ to a C shape, and we can only get a C shape by adding a horizontal $1 times 2$ to a rectangle. Then we get
        $$A(n)=A(n-1)+B(n-1)+A(n-2)\
        B(n)=A(n)+B(n-1)+A(n-1)\
        B(n-1)-B(n-2)=A(n-1)+A(n-2)\
        A(n-1)=A(n-2)+B(n-2)+A(n-3)\
        A(n)-A(n-1)=A(n-1)+B(n-1)-B(n-2)-A(n-3)\
        A(n)=3A(n-1)+A(n-2)-A(n-3)$$



        The sequence is given in OEIS A030186 and begins $$1, 2, 7, 22, 71, 228, 733, 2356, 7573, 24342, 78243, 251498, 808395, 2598440, 8352217, 26846696, 86293865, 277376074, 891575391, 2865808382, 9211624463, 29609106380, 95173135221, 305916887580, 983314691581, 3160687827102 $$

        The fourth comment says this is the count of the tilings we want.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 13 '18 at 17:49









        Ross MillikanRoss Millikan

        298k23198371




        298k23198371






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3038311%2fin-how-many-ways-can-a-2-times-n-rectangle-be-tiled-by-2-times-1-or%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Plaza Victoria

            Image
            Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
            Read more

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 OneNote has two useful keyboard shortcuts for bulleted and numbered lists, namely Ctrl + . and Ctrl + - . Is there something similar for PowerPoint where the work with lists is also very common? Haven't found anything here: Use keyboard shortcuts in PowerPoint. keyboard-shortcuts microsoft-powerpoint share | improve this question edited Aug 14 '14 at 14:49 Linger 2,826 10 28 40
            Read more

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...

            Image
            1 0 I want to put 3 images in LateX such as 2 figures are side by side horizotally and 3rd figure below these 2 side by side figures but in middle. I have following code: begin{figure}[H] centering begin{minipage}{.5textwidth} centering includegraphics[width=.50linewidth]{Text/Images/Genelec_8010_AP.jpg} captionof{figure}{Genelec 8010 AP} label{fig:Genelec 8010} end{minipage}% begin{minipage}{.5textwidth} centering includegraphics[width=.69linewidth]{Text/Images/Genelec_8020_CPM.jpg} captionof{figure}{Genelec 8020 CPM} label{fig:Genelec 8020} end{minipage}% end{figure} %%Here is my 3rd picture code begin{figure} centering includegraphics[width=5cm]{Text/Images/Genelec_8030_BPM.jpg} caption{Genelec 8030 BPM} label{fig:Genelec 8030} end{figure} I want to ask ho
            Read more