olymmath

ILL 1972 Problem 33

    A rectangle ABCDABCD is given whose sides have lengths 33 and 2n2n , where nn is a natural number. Denote by U(n)U(n) the number of ways in which one can cut the rectangle into rectangles of side lengths 11 and 22 . (a)(a) Prove that U(n+1)+U(n−1)=4U(n);U(n + 1)+U(n -1) = 4U(n); (b)(b) Prove that U(n)=123[(3+1)(2+3)n+(3−1)(2−3)n].U(n) =\frac{1}{2\sqrt{3}}[(\sqrt{3} + 1)(2 +\sqrt{3})^n + (\sqrt{3} - 1)(2 -\sqrt{3})^n].

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ill/1972/p33 · Tag A801KT0F4B · Edit this page on GitHub · Keys: j next, k previous