Qualification > Math

Matrix Powers

(1/3) > >>

nid404:
Some1 please solve the last two questions
Thanks

eightAs:


Not sure about the proof yet. This is based only on pattern spotting.

eightAs:
Ok prove it using Mathematical Induction
We want to show that the statement is true for all
.
Now substitue values in the formula to check. Therefore the formula is true for n = 1.
We may assume that our formula holds for n. And multiply with to evaluate and simplify to show that the formula is true for (n + 1) as well. The calculations would look ugly even in Latex, so I am skipping them.

 

nid404:
thanks :)...actually im doin AS and don't a know a thing abt this portfolio....this is one of my friend's

Could u help me by telling how lengthy the response for the questions should be...as in the explanation

eightAs:

--- Quote from: nid404 on January 02, 2010, 12:30:05 pm ---thanks :)...actually im doin AS and don't a know a thing abt this portfolio....this is one of my friend's

Could u help me by telling how lengthy the response for the questions should be...as in the explanation

--- End quote ---
I'm not an IB student either. I do AS as well and the only reason I knew Mathematical induction is because it is there in the Further math syllabus. I'd rather not comment :-X

Navigation

[0] Message Index

[#] Next page