Explanation Formula used: A recurrence relation is a procedure for finding the terms of a sequence in a recursive manner. It is an equation that recursively defines a sequence where the next term is a function of the previous terms. Calculation: Note that two L-shaped pieces can be assembled to form a 2 × 3 rectangle. A 6 × 2 board can be covered by two of these 2 × 3 rectangles (and hence by four L-shaped pieces). In general, changing the board from size 6 × ( n − 1) to size 6 × n increases the area of the board by 6 units, so the larger board requires 1 additional rectangle (two additional L-shaped pieces) to cover it...

5th Edition

ISBN: 9780134689562

Author: Dossey, John A.

Publisher: Pearson,

See similar textbooks

Concept explainers

Sequence and Series

A sequence is defined as a collection of things. Series is defined to sum the things one by one in the sequence. It was invented by German mathematician Carl Friedrich Gauss.

Videos

Question

Chapter 9.1, Problem 28E

To determine

To write: A recurrence relation and the initial conditions for pn, the number of L-shaped pieces needed to cover a 6× n checkerboard.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 9.1, Problem 27E

Chapter 9.1, Problem 29E

Students have asked these similar questions

Let A = {x Z | x=0 (mod 6)} and B = {x = Z | x = 0 (mod 9)}. Which of the following sentences describes the set relationship between A and B ? *Keep in mind that Ç means proper subset. AÇ B BÇA A = B AnB = 0 none of these

Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} be the universal set. Let A = {0, 1, 2, 3, 9} and B = {2, 3, 4, 5, 6}. Select all elements in An B. 2 3 4 5 18 7 8 9 ☐ 10

Let U = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} be the universal set. Let A = {0, 1, 2, 3, 9} and B = {2, 3, 4, 5, 6}. Select all elements in An B. 1 2 ✓ 3 + 5 10 7 > 00 ☐ 10

Chapter 9 Solutions

Discrete Mathematics

Ch. 9.1 - Prob. 1E Ch. 9.1 - Prob. 2E Ch. 9.1 - Prob. 3E Ch. 9.1 - Prob. 4E Ch. 9.1 - Prob. 5E Ch. 9.1 - Prob. 6E Ch. 9.1 - Prob. 7E Ch. 9.1 - Prob. 8E Ch. 9.1 - Prob. 9E Ch. 9.1 - Prob. 10E

Ch. 9.1 - Prob. 11E Ch. 9.1 - Prob. 12E Ch. 9.1 - Prob. 13E Ch. 9.1 - Prob. 14E Ch. 9.1 - Prob. 15E Ch. 9.1 - Prob. 16E Ch. 9.1 - Prob. 17E Ch. 9.1 - Prob. 18E Ch. 9.1 - Prob. 19E Ch. 9.1 - Prob. 20E Ch. 9.1 - Prob. 21E Ch. 9.1 - Prob. 22E Ch. 9.1 - Prob. 23E Ch. 9.1 - Prob. 24E Ch. 9.1 - Prob. 25E Ch. 9.1 - Prob. 26E Ch. 9.1 - Prob. 27E Ch. 9.1 - Prob. 28E Ch. 9.1 - Prob. 29E Ch. 9.1 - Prob. 30E Ch. 9.1 - Prob. 31E Ch. 9.1 - Suppose that you have an unlimited supply of red,...Ch. 9.1 - Prob. 33E Ch. 9.1 - Prob. 34E Ch. 9.1 - Prob. 35E Ch. 9.1 - Prob. 36E Ch. 9.1 - Prob. 37E Ch. 9.1 - Prob. 38E Ch. 9.2 - Prove by mathematical induction that n2 − n + 2 is...Ch. 9.2 - Prob. 2E Ch. 9.2 - Prob. 3E Ch. 9.2 - Prob. 4E Ch. 9.2 - Prob. 5E Ch. 9.2 - Prove by mathematical induction that is a...Ch. 9.2 - Prob. 7E Ch. 9.2 - Prob. 8E Ch. 9.2 - Prob. 9E Ch. 9.2 - Prob. 10E Ch. 9.2 - In Exercises 11–24, use the method of iteration to...Ch. 9.2 - Prob. 12E Ch. 9.2 - In Exercises 11–24, use the method of iteration to...Ch. 9.2 - In Exercises 11–24, use the method of iteration to...Ch. 9.2 - Prob. 15E Ch. 9.2 - In Exercises 11–24, use the method of iteration to...Ch. 9.2 - In Exercises 11–24, use the method of iteration to...Ch. 9.2 - Prob. 18E Ch. 9.2 - Prob. 19E Ch. 9.2 - Prob. 20E Ch. 9.2 - Prob. 21E Ch. 9.2 - Prob. 22E Ch. 9.2 - Prob. 23E Ch. 9.2 - Prob. 24E Ch. 9.2 - Prob. 25E Ch. 9.2 - Prob. 26E Ch. 9.2 - Prob. 27E Ch. 9.2 - Prob. 28E Ch. 9.2 - Prob. 29E Ch. 9.2 - Consider the sequences of n terms in which each...Ch. 9.2 - Prob. 31E Ch. 9.2 - Prob. 32E Ch. 9.2 - Prob. 33E Ch. 9.2 - Prob. 34E Ch. 9.3 - In Exercises 1–24, find an explicit formula for sn...Ch. 9.3 - Prob. 2E Ch. 9.3 - Prob. 3E Ch. 9.3 - Prob. 4E Ch. 9.3 - Prob. 5E Ch. 9.3 - Prob. 6E Ch. 9.3 - Prob. 7E Ch. 9.3 - Prob. 8E Ch. 9.3 - Prob. 9E Ch. 9.3 - Prob. 10E Ch. 9.3 - Prob. 11E Ch. 9.3 - Prob. 12E Ch. 9.3 - Prob. 13E Ch. 9.3 - Prob. 14E Ch. 9.3 - Prob. 15E Ch. 9.3 - Prob. 16E Ch. 9.3 - Prob. 17E Ch. 9.3 - Prob. 18E Ch. 9.3 - Prob. 19E Ch. 9.3 - Prob. 20E Ch. 9.3 - Prob. 21E Ch. 9.3 - Prob. 22E Ch. 9.3 - Prob. 23E Ch. 9.3 - Prob. 24E Ch. 9.3 - Prob. 25E Ch. 9.3 - Prob. 26E Ch. 9.3 - Prob. 28E Ch. 9.3 - Prob. 30E Ch. 9.3 - Prob. 31E Ch. 9.3 - Prob. 32E Ch. 9.3 - Prob. 33E Ch. 9.3 - Prob. 34E Ch. 9.3 - Prob. 35E Ch. 9.3 - Prob. 36E Ch. 9.3 - Prob. 37E Ch. 9.3 - Prob. 38E Ch. 9.4 - Prob. 1E Ch. 9.4 - Prob. 2E Ch. 9.4 - Prob. 3E Ch. 9.4 - Prob. 4E Ch. 9.4 - Prob. 5E Ch. 9.4 - Prob. 6E Ch. 9.4 - Prob. 7E Ch. 9.4 - Prob. 8E Ch. 9.4 - Prob. 9E Ch. 9.4 - Prob. 10E Ch. 9.4 - Prob. 11E Ch. 9.4 - Prob. 12E Ch. 9.4 - Prob. 13E Ch. 9.4 - Prob. 14E Ch. 9.4 - Prob. 15E Ch. 9.4 - Prob. 16E Ch. 9.4 - Prob. 17E Ch. 9.4 - Prob. 18E Ch. 9.4 - Prob. 19E Ch. 9.4 - Prob. 20E Ch. 9.4 - Prob. 22E Ch. 9.4 - Prob. 24E Ch. 9.4 - Prob. 26E Ch. 9.4 - Prob. 30E Ch. 9.4 - Prob. 32E Ch. 9.4 - Prob. 34E Ch. 9.4 - Prob. 36E Ch. 9.4 - Prob. 38E Ch. 9.5 - Prob. 1E Ch. 9.5 - Prob. 2E Ch. 9.5 - Prob. 3E Ch. 9.5 - Prob. 4E Ch. 9.5 - Prob. 5E Ch. 9.5 - Prob. 6E Ch. 9.5 - Prob. 7E Ch. 9.5 - Prob. 8E Ch. 9.5 - Prob. 9E Ch. 9.5 - Prob. 10E Ch. 9.5 - Prob. 11E Ch. 9.5 - Prob. 12E Ch. 9.5 - Prob. 13E Ch. 9.5 - Prob. 14E Ch. 9.5 - Prob. 15E Ch. 9.5 - Prob. 16E Ch. 9.5 - Prob. 17E Ch. 9.5 - Prob. 18E Ch. 9.5 - Prob. 19E Ch. 9.5 - Prob. 20E Ch. 9.5 - Prob. 21E Ch. 9.5 - Prob. 22E Ch. 9.5 - Prob. 23E Ch. 9.5 - Prob. 24E Ch. 9.5 - Prob. 25E Ch. 9.5 - Prob. 26E Ch. 9.5 - Prob. 27E Ch. 9.5 - Prob. 28E Ch. 9.5 - Prob. 29E Ch. 9.5 - Prob. 30E Ch. 9.5 - Prob. 31E Ch. 9.5 - Prob. 32E Ch. 9.5 - Prob. 33E Ch. 9.5 - Prob. 34E Ch. 9.5 - Prob. 35E Ch. 9.6 - Prob. 1E Ch. 9.6 - Prob. 2E Ch. 9.6 - Prob. 3E Ch. 9.6 - Prob. 4E Ch. 9.6 - Prob. 5E Ch. 9.6 - Prob. 6E Ch. 9.6 - Prob. 7E Ch. 9.6 - Prob. 8E Ch. 9.6 - Prob. 9E Ch. 9.6 - Prob. 10E Ch. 9.6 - Prob. 11E Ch. 9.6 - Prob. 12E Ch. 9.6 - Prob. 13E Ch. 9.6 - Prob. 14E Ch. 9.6 - Prob. 15E Ch. 9.6 - Prob. 16E Ch. 9.6 - Prob. 17E Ch. 9.6 - Prob. 18E Ch. 9.6 - Prob. 19E Ch. 9.6 - Prob. 20E Ch. 9.6 - Prob. 21E Ch. 9.6 - In Exercises 21–26, find constants a and b such...Ch. 9.6 - Prob. 23E Ch. 9.6 - Prob. 24E Ch. 9.6 - Prob. 25E Ch. 9.6 - Prob. 26E Ch. 9.6 - Prob. 27E Ch. 9.6 - Prob. 28E Ch. 9.6 - Prob. 29E Ch. 9.6 - Prob. 30E Ch. 9.6 - Prob. 31E Ch. 9.6 - Prob. 32E Ch. 9.6 - Prob. 34E Ch. 9.6 - Prob. 35E Ch. 9.6 - Prob. 36E Ch. 9.6 - Prob. 37E Ch. 9.6 - Prob. 38E Ch. 9.6 - Prob. 39E Ch. 9.6 - Prob. 40E Ch. 9.6 - Prob. 41E Ch. 9.6 - Prob. 42E Ch. 9 - Prob. 1SE Ch. 9 - Prob. 2SE Ch. 9 - Prob. 3SE Ch. 9 - Prob. 4SE Ch. 9 - Prob. 6SE Ch. 9 - A data processing position pays a starting salary...Ch. 9 - Prob. 8SE Ch. 9 - Prob. 9SE Ch. 9 - Prob. 10SE Ch. 9 - Prob. 11SE Ch. 9 - Prob. 12SE Ch. 9 - Prob. 13SE Ch. 9 - Prob. 14SE Ch. 9 - Prob. 17SE Ch. 9 - Prob. 18SE Ch. 9 - Prob. 19SE Ch. 9 - Prob. 21SE Ch. 9 - Prob. 22SE Ch. 9 - Prob. 23SE Ch. 9 - Prob. 41SE Ch. 9 - Prob. 42SE Ch. 9 - Prob. 43SE Ch. 9 - Prob. 44SE Ch. 9 - Prob. 45SE Ch. 9 - Prob. 46SE Ch. 9 - Prob. 47SE Ch. 9 - Prob. 48SE

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

A recurrence relation and the initial conditions for p n , the number of L-shaped pieces needed to cover a 6 × n checkerboard.

Concept explainers

Videos

To write: A recurrence relation and the initial conditions for pn, the number of L-shaped pieces needed to cover a 6× n checkerboard.

Want to see the full answer?

Chapter 9 Solutions