induction (1 Viewer)

[FOB all the way]

i get it and i can normally get most induction questions out but what conclusion it the best
i use result is true gor n=k+1 if it is true for n=k
since it is true for n=1 hence the sresult is true for all positive values of n by induction (or what ever the conditions are)

is that right and is it any different id it is an inequality or divisability question

 

[tommykins]

i normally just write -

hence by the principle of mathematical induction the statement is true for all n > whatever

 

[Js^-1]

In an exam you shouldn't write out the massive paragraph that they say to in Textbooks.

The paragraph is:
'If the statement is true for n=k, then the statement is also true for n=k+1, since the statement is true for n=1, it follows that it is also true for n=2. Since it is true for n=2, it follows that it is also true for n=3, and so on for all positive integer values of n greater than 1. '

The examiners don't want you to write this. After the third step, i.e. prove true for n = k+1, then you simply write "Thus the statement is true for n>1 (or whatever the case may be) by the principal of mathematical induction.

 

[u-borat]

PMI




though i'd be inclined to write the whole paragraph out if it wasn't a usual induction; like one of those ones where you need to assume for n and n+1, then prove for n+2 etc.

 

[tommykins]

hahaha just write like
tru 4 n=1 PMI tru n>1