Induction (1 Viewer)

[pikachu975]

http://prntscr.com/fqo97b

For this, the marking guidelines says n=1,2,3 is obviously true so they prove base case n = 4
They assume true for n = k for k>=5
Prove true for n = k + 1

Would it be alright to do base case as n = 1
Assume true for n = k, n = k+1, n = k+2
Then prove true for n = k + 3
I did this and it worked but not sure if it's allowed, thanks!

 

[InteGrand]

http://prntscr.com/fqo97b

For this, the marking guidelines says n=1,2,3 is obviously true so they prove base case n = 4
They assume true for n = k for k>=5
Prove true for n = k + 1

Would it be alright to do base case as n = 1
Assume true for n = k, n = k+1, n = k+2
Then prove true for n = k + 3
I did this and it worked but not sure if it's allowed, thanks!

 

[pikachu975]

Thanks for the detailed response, would it be alright to use my method or is it compulsory to make the base case n = 4 and go from there?

 

[InteGrand]

Thanks for the detailed response, would it be alright to use my method or is it compulsory to make the base case n = 4 and go from there?

Must do n = 4 as base case and go from there (after having verified n = 1, 2, 3).