Answer:
Step-by-step explanation:
Answer:
![\left[\begin{array}{cccc}1&3&4&5\&3&1&5&6\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%263%264%265%5C%263%261%265%266%5Cend%7Barray%7D%5Cright%5D)
The only ones are on the "diagonal", where i = j. Else the position is simply the sum.
Step-by-step explanation:
We are picking 6 numbers from the numbers 1,2,3,4,5,6,7,8,9,10. Since we care about numbers being next to each other, we might think of the 10 numbers as being distributed in 5 boxes (which you can think of as the holes):
| 1 2 | 3 4 | 5 6 | 7 8 | 9 10 |
So on the first box we have the numbers 1 and 2, on the second box we have the numbers 3 and 4, and so on. Since we are picking 6 numbers from those 10 numbers, that means we'll have to pick 6 boxes (and inside each box we pick a number), but we only have 5 available boxes, so by the pigeonhole principle, we'll have to pick 1 same box at least two times. Since on each picked box we'll need to pick a number, on this box which was picked two times, we will have to pick both of its numbers. And so those 2 numbers inside that box will be next to each other (meaning they're consecutive numbers).
B
the other options all have a set price, the answers in b could all change price from month to month
Graph not attached, linear equation: y=-4x+10
