Matrix Problem

  • Thread starter Bashyboy
  • Start date
  • #1
Bashyboy
1,421
5

Homework Statement


I attached the problem as a file


Homework Equations





The Attempt at a Solution


The way I tried to solve this was to write out a few multiplications and find a pattern. I got the right answer, but I was wondering if there was more of a precise way of doing it; or would the procedure that I used be acceptable for a first course in Discrete Mathematics?
 

Attachments

  • Capture.JPG
    Capture.JPG
    5.2 KB · Views: 373

Answers and Replies

  • #2
clamtrox
938
9
After you found the rule, try proving it using induction. Show first that it holds for n=2 and then show if it holds for n, then it also holds for n+1.
 
  • #3
raopeng
86
0
Or use orthogonalisation(writing A in the form of [itex]C^{-1}BC[/itex]) in which B is an orthogonal matrix. Then the multiplication can be simplified into: [itex]A^n = C^{-1}B^{n}C[/itex].
 
Last edited:
  • #4
Bashyboy
1,421
5
Thank you, Clamtrox.

Raopenq, we haven't learned about orthogonalisation.
 
  • #5
clamtrox
938
9
Good, because the matrix is not diagonalizable :) If you want to understand a bit more what's happening here, it might be useful to write the matrix as
[tex]A = \left( \begin{array}{cc} 1 & 1 \\ 0 & 1 \end{array} \right) = \left( \begin{array}{cc} 1 & 0 \\ 0 & 1 \end{array} \right) + \left( \begin{array}{cc} 0 & 1 \\ 0 & 0 \end{array} \right) [/tex]
and then look how these two matrices multiply together.
 
  • #6
STEMucator
Homework Helper
2,076
140
Start by multiplying out A2 and A3, what do you notice about the entry a12? Also, use the fact that matrix addition is entry wise.

Both of these should allow you to complete a full induction proof.
 
  • #7
raopeng
86
0
oops sorry...
 

Suggested for: Matrix Problem

  • Last Post
Replies
1
Views
154
Replies
9
Views
297
Replies
0
Views
179
Replies
4
Views
271
Replies
6
Views
328
Replies
14
Views
531
Replies
5
Views
254
Replies
8
Views
659
Top