Two matrices are said to be equal if every corresponding elements in the matrices are equal.
So in this case, since the two matrices are equal, then $m=3$m=3 and $n=7$n=7.
Simultaneous equations follow the convention of organising the coefficients into matrix notation. For instance, consider the two equations $x+2y=7$x+2y=7and $2x-5y=-4$2x−5y=−4. This system can be written like this using matrices.
This will be covered in more detail when looking at matrix multiplication in a later lesson.
Consider the equation |
|
$=$= |
|
. |
Solve for $x$x.
Solve for $y$y.
When simply being used to store data, is it not necessary to use the labelling conventions and simply create the matrix. Consider the following table:
Distances between towns | |||
---|---|---|---|
A | B | C | |
A | $0$0 | $23$23 | $17$17 |
B | $23$23 | $0$0 | $43$43 |
C | $17$17 | $43$43 | $0$0 |
The above situation is converted to a matrix like this:
However, when undertaking mathematical processes using the data stored in matrices, the defining of rows and columns must follow normal conventions.
Two-way frequency tables follow the convention of independent variable headings in the columns and dependent variables as the rows.
A survey was completed at a school that has both secondary and primary school students. They were asked if the playground should have fewer, same or more seating options. The results are displayed in the table below:
Attitude | Primary | Secondary |
---|---|---|
Fewer | $5$5 | $2$2 |
Same | $29$29 | $9$9 |
More | $33$33 | $36$36 |
Total | $67$67 | $47$47 |
This can be written as a matrix. The result would be:
Here is a network showing roads between towns. Put the information into a matrix.
Think: We can construct a matrix, where the entries represent the number of paths between the towns.
Do: We will need to set up a $5\times5$5×5 matrix, where each of the rows and columns represents a town.
The next step is to fill in the numbers of roads between them. There are two roads between towns $1$1 and $3$3, so we input a $2$2 in $a_{13}$a13 and $a_{31}$a31. As there are no roads connecting town $2$2 with any other towns, all elements in row $2$2 and column $2$2 are $0$0.
Generate a matrix to represent the following two way frequency table for party preference for the over $30$30's and under $30$30's. Let the rows represent the values of the party preferences and the columns represent the age groups.
Party preference | Under $30$30's | Over $30$30's |
---|---|---|
Labour | $16$16 | $22$22 |
Liberal | $10$10 | $19$19 |
Total | $26$26 | $41$41 |
Think: Since the rows and columns in the two way frequency table correspond to the rows and columns of the matrix, we can simply transfer the information into a matrix.
Do: The matrix is then given by the following:
Jack, a chef, is known for his CrazyCookie, which requires $360$360 g of yeast, $410$410 g of salt, $340$340 g of flour, $230$230 g of sugar and $120$120 g of honey. He is also known for his ScrumptiousSurprise, which requires $420$420 g of yeast, $390$390 g of salt, $330$330 g of flour, $200$200 g of sugar and $80$80 g of honey.
Organise the data into a $2\times5$2×5 matrix.
Let the first row be the values for CrazyCookie and the second row be the values for ScrumptiousSurprise.
Let the columns be values of each ingredient, in the order given in the instructions.
$\editable{}$ | $\editable{}$ | $\editable{}$ | $\editable{}$ | $\editable{}$ | |||||
$\editable{}$ | $\editable{}$ | $\editable{}$ | $\editable{}$ | $\editable{}$ |