Name:_____________________ Math 1314 Homework Passport 1



Name:________________________ Math 1324 Activity 8(Due by Feb. 28)

Dear Instructor or Tutor,

These problems are designed to let my students show me what they have learned and what they are capable of doing on their own. Please allow them to work the problems on their own! If you would like to help them with similar problems, here are the related homework problems: pg. 226:1-59 odd. Thanks!

Find the following matrix products, if possible.

1. [pic] 2. [pic]

3. [pic] 4. [pic]

Determine if the given pairs of matrices are inverses. Show work.

5.[pic] 6. [pic]

Find the inverse, if it exists, for the following matrices. Show work.

7. [pic]

8. [pic]

9. [pic]

10. [pic]

11. Burger Barn’s three locations sell hamburgers, fries, and soft drinks. Barn I sells 900 burgers, 600 orders of fries, and 750 soft drinks each day. Barn II sells 1500 burgers, 950 orders of fries, and 900 soft drinks each day. Barn III sells 1150 burgers, 800 orders of fries, and 825 soft drinks each day.

a) Complete the [pic] matrix, S, that represents the sales figures for all three locations.

[pic]

b) Burgers cost $2.00 each, fries $1.50 an order, and soft drinks $1.00 each. Complete the [pic] matrix P that displays the prices.

[pic]

c) What matrix product displays the daily revenue at each of the three locations?

d) Compute this matrix product to determine the daily revenue at each location.

12. A nationwide air freight service has connecting flights between five cities as illustrated in the diagram. To represent this schedule in matrix form, we construct a [pic] incidence matrix A, where the row numbers represent the origin of each flight and the column numbers represent the destinations. We place a 1 in the ith row and jth column of this matrix if there is a connecting flight from the ith city to the jth city; otherwise, insert a 0. We also place zeros on the diagonal because a connecting flight with the same origin and destination makes no sense. With the schedule represented in this matrix form, we can perform operations on this matrix to obtain information about the schedule.

a) Complete the [pic] incidence matrix A.

[pic]

b) Find [pic].

c) What does the 1 in Row 2 and Column 1 of [pic] indicate about the schedule? What does the 2 in Row 1 and Column 3 indicate about the schedule? In general, how would you interpret each element not on the diagonal of[pic]?

d) Find [pic].

e) What does the 1 in Row 4 and Column 2 of [pic] indicate about the schedule? What does the 2 in Row 1 and Column 5 indicate about the schedule? In general, how would you interpret each element not on the diagonal of[pic]?

f) Compute [pic] until you obtain a matrix with no 0 entries(except possibly on the diagonal), and interpret.

Just For Fun: A famous problem has a shepherd, a boat, a wolf, a sheep, and a cabbage on the left side of a river. The shepherd is to transport everything - himself, the boat, the animals, and the cabbage - to the right side of the river. He cannot leave the wolf and the sheep or the sheep and the cabbage unattended, and he can carry at most one occupant(in addition to himself) in the boat at one time. The states in this problem will be the list of inhabitants on the left bank of the river. The only allowable states are then S1 = [boat, shepherd, wolf, sheep, cabbage], S2 = [boat, shepherd, wolf, sheep], S3 = [boat, shepherd, wolf, cabbage], S4 = [boat, shepherd, sheep, cabbage], S5 = [boat, shepherd, sheep], S6 = [], S7 = [cabbage], S8 = [sheep], S9 = [wolf], S10 = [wolf, cabbage]. Complete the 10 x 10 incidence matrix, A:

| | | | |End of |boat trip | | | | | | | | |S1 |S2 |S3 |S4 |S5 |S6 |S7 |S8 |S9 |S10 | | | | |S1 |0 |0 |0 |0 |0 |0 |0 |0 |0 |1 | | | | |S2 | |0 |0 |0 |0 |0 |0 |1 |1 |0 | | | | |S3 | | |0 |0 |0 |0 |1 |0 |1 |1 | | | | |S4 | | | |0 |0 |0 |1 |1 |0 |0 | | | |Start of boat trip |S5 | | | | |0 |1 |0 |1 |0 |0 |= |A | | |S6 | | | | | |0 |0 |0 |0 |0 | | | | |S7 | | | | | | |0 |0 |0 |0 | | | | |S8 | | | | | | | |0 |0 |0 | | | | |S9 | | | | | | | | |0 |0 | | | | |S10 | | | | | | | | | |0 | | | |Use the fact that A is symmetric to speed up the process. Determine the smallest number of crossings in which the deed can be done - if, indeed, it can be done, by considering powers of the incidence matrix A. The deed is done if there is at least one route from [pic] to [pic].

Bonus: Decode the contents of the rectangle into a familiar word or phrase.

-----------------------

1

2

3

4

5

Atlanta

Baltimore

Chicago

Denver

El Paso

come serve

come serve

come serve

come serve

................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download