ok this induction q i just have no idea how to do...i got to the n=k+1 bit and it was impossible from there.
1. Use mathematical induction to prove n<sup>2</sup> > 10n + 7 for all n>= 11.
I'll type out my working later if anyone is desperate to see it.
2. Find S x(1-x<sup>2</sup>)<sup>4</sup> using the substitution u=1-x.
I just dont know where to start with this one...how do you use the substitution?
S=integration symbol thing
Thanks guys
1. Use mathematical induction to prove n<sup>2</sup> > 10n + 7 for all n>= 11.
I'll type out my working later if anyone is desperate to see it.
2. Find S x(1-x<sup>2</sup>)<sup>4</sup> using the substitution u=1-x.
I just dont know where to start with this one...how do you use the substitution?
S=integration symbol thing
Thanks guys