Can some one help me with the proof by induction question in june 2007 please ? THis chapter really confuses me :/
Which bit is it that you can't do specifically? You just do the initial step but starting from n=2 rather than n=1 and then assume true for n=k. Work out your goal as usual by subbing in k+1. Then the sum multiplied by (1-1/(k+1)^2) gives you your goal therefore it's proven by induction (which you can just quote from part a) I assume.
Which bit is it that you can't do specifically? You just do the initial step but starting from n=2 rather than n=1 and then assume true for n=k. Work out your goal as usual by subbing in k+1. Then the sum multiplied by (1-1/(k+1)^2) gives you your goal therefore it's proven by induction (which you can just quote from part a) I assume.
Ah right okay, thank you! I'll have another look now (:
Predictions for tomorrow? I reckon hard de Moivre's as last year's was quite easy (also if anyone knows any resources for hard last minute de Moivre questions it would be appreciated )
Predictions for tomorrow? I reckon hard de Moivre's as last year's was quite easy (also if anyone knows any resources for hard last minute de Moivre questions it would be appreciated )
I will accept my fate as soon as I see 9 questions with hard-core DM question as 9th.
Predictions for tomorrow? I reckon hard de Moivre's as last year's was quite easy (also if anyone knows any resources for hard last minute de Moivre questions it would be appreciated )
June 2013 DM was lovely, did that paper as a mock very recently.