


Every2x2" board, with one square removed, could be covered with triominos Determine a formula cou...
Problem 5 (Counting triominos) [20 marks/ We saw in class that every 2n x 2 board, with one square removed, could be covered with triominos Determine a formula counting the number of triominos covering such a trun- cated 2" x 2n board. Prove this formula by induction
Problem 5 (Counting triominos) [20 marks/ We saw in class that every 2n x 2 board, with one square removed, could be covered with triominos Determine a formula counting the number of triominos...
Problem 5 (Counting triominos) [20 marks] We saw in class that every 2 n × 2 n board, with one square removed, could be covered with triominos. Determine a formula counting the number of triominos covering such a truncated 2 n × 2 n board. Prove this formula by induction. I have seen solutions for this question posted but they seem to use iteration rather than induction and use notation that I don't understand.
A sidewalk with n squares (in one long row) is to be painted. Each square will be painted red, blue, or yellow with the property that adjacent squares are always colored differently. Let on be a sequence counting the number of ways to color a sidewalk of length n. (a) Compute c1, C2, c3, and c4. (b) Find a recursive formula for cn (c) Find a closed formula for cn (d) Use induction to prove that your closed formula is...
Hi, I would appreciate any help for this problem I don't really
understand for discrete math. Thanks! (:
15. (P5) Remember, an L-tromino is a shape consisting of three equal squares joined at the edges to form a shape resembling the capital letter L. Consider the following "theorem" "Theorem": For any integer n 1, if one square is removed from a 2·2" × 3·2" checkerboard. the remaining squares can be completely covered by L-shaped trominoes. What follows is a supposed...
GIVE A DIRECT COUNTING ARGUMENT AND DERIVE THE FORMULA USING A
GENERATING FUNCTION
Prove that the number of partitions of the positive integer n into parts each of which is at most 2 (n+3)2 12 equals Ln/21. (Remark: There is a formula, namely the nearest integer to for the number of partitions of n into parts each of which is at most 3 but it is much more difficult to prove. There is also one for partitions with no part...
A chess board has its top left and bottom right corner squares cut out leaving 62 squares. We have a supply of dominoes, each of which will cover 2 adjacent squares. Is there a way to exactly cover an entire board? What difference does cutting out the 2 opposing corners make ? Could we just simply try and see if we can do this? a) If a rectangular board is completely covered with tetrominoes show that at least one side...
A 69-cm x 69-cm circuit board that contains 121 square chips on one side is to be cooled by combined natural convection and radiation by mounting it on a vertical surface in a room at 25°C. Each chip dissipates 0.18 W of power, and the emissivity of the chip surfaces is 0.7. Assume the heat transfer from the back side of the circuit board to be negligible, and the temperature of the surrounding surfaces to be the same as the...
2) Prove that the square of any odd number leaves a remainder of one when divided by 8. (Hint: use cases expressing the odd number in the form 8k+r, where r<8)
(9.1) A knight, on a chess board, moves two squares forward and one square to the right. (a) Determine the knight’s displacement in terms of components. (b) Determine the magnitude and direction of the knight’s displacement. (9.2) A person set out at 11:00 AM one day and walked three blocks east. Turning a corner, he then continued walking four blocks north. Just as he reached the end of the fourth block, his watch read 11:10. (a) Determine the person’s displacement...
Using Burnside's Lemma, determine a formula for the number of orbits under the action of D8 on the set of colourings. (We colour each side of a square with one of k ≥ 1 colours.)