IGCSE/GCSE/O & A Level/IB/University Student Forum
Qualification => Subject Doubts => IB => Math => Topic started by: nid404 on January 01, 2010, 06:56:00 am
-
Some1 please solve the last two questions
Thanks
-


Not sure about the proof yet. This is based only on pattern spotting.
-
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.
-
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
-
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
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
-
Cuz we found the general form...the same thing...but we didn't know how to prove it as such....and describe it as they ask :-\
Anyway thanks a lot for your help
-
I will do it when I get home
-
Ok I'll put forward a general induction argument. This is going to be a long post. I have an IB HL book which lists out five steps involved in an induction proof. They are:
1. Prove the result for an initial value usually (n = 1).
2. Assume the result is true for another value n = k, k>1 stating the result.
3. Consider the case n = k + 1, writing down the goal clearly - the required form.
4. Using the assumption, now show that the result is true for n = k + 1.
5. Communicate why this proves this result using mathematical induction.
There are some comments at the end of the proof.
Our conjecture is 
where 
Write it as:  & 2^{n-1}(k^n - 1)\\ 2^{n-1}(k^n - 1) & 2^{n-1}(k^n + 1) \end{pmatrix} )
Step 1: when n = 1.
which is clearly true since A raised to 1 is A itself.
Step 2: So lets assume for some integer j, the formula is true. Notice we're not using n = k here (as described in the five steps above) as we already have a variable k.

Step 3: Substitute n = j + 1 in the original equation.
(k^{j+1} + 1) & (2^{j})(k^{j+1} - 1)\\ (2^{j})(k^{j+1} - 1) & (2^{j})(k^{j+1} + 1) \end{pmatrix})
This is what we have to prove, using the assumption in Step 2.
Step 4: The ugly calculations!
Step 5: Conclude that this matrix is same as the one that appeared at the end of step 3. So the result is true for n = j + 1 when true for n = j. Since it is true for n = 1, it is true
by the principle of Mathematical Induction.
Since the project is being judged for presentation, notation and whatnot. I strongly recommend that your friend sticks to the notation I used, (as they are straight out of an IB (HL) book :P ) and lays out her proof in an organized manner. :)
-
omg! Thank you so very much for taking the pains to put this thing down...
THanks A Lot :D
-
omg! Thank you so very much for taking the pains to put this thing down...
THanks A Lot :D
No problem. By the way, do you have the markscheme for this paper?
-
naah...it's not a paper...it's supposed to be their math portfolio for which they are marked...I have no idea about how it should look and my friend is unaware too cuz it is his first year in ib...
Anyway you have been of great help....And since your matter comes straight from IB HL I don't have to doubt it :P
-
can u please help me solve this matrix question??
Write 5A2-6A=3I in the form AB=I and hence find A-1 in terms of A and I
please help fasssssssssttttttttttttt!!!!!!!!!!!!!!!!!!!!!!!