J js992 Member Joined Nov 15, 2009 Messages 84 Gender Male HSC 2010 Mar 8, 2010 #1 I've worked it out but theres one step im not too sure of. When proving true for n= k+1. If not, how do i find out what T(k-1) is?
I've worked it out but theres one step im not too sure of. When proving true for n= k+1. If not, how do i find out what T(k-1) is?
untouchablecuz Active Member Joined Mar 25, 2008 Messages 1,693 Gender Male HSC 2009 Mar 9, 2010 #2 yes you are this is a stronger type of induction called "strong induction" (lol) not only do you assume S(k) to be true but rather, you assume S(1), S(2)...S(k) to be true google for more info also, this type of Q is out of the MX1 syllabus
yes you are this is a stronger type of induction called "strong induction" (lol) not only do you assume S(k) to be true but rather, you assume S(1), S(2)...S(k) to be true google for more info also, this type of Q is out of the MX1 syllabus
C cutemouse Account Closed Joined Apr 23, 2007 Messages 2,250 Gender Undisclosed HSC N/A Mar 9, 2010 #3 To me there's no difference between the supposed 'strong' and 'weak' variations of induction...