Induction Proof

[bold stump]

anyone knows how to do this please? help me

[cursive flame]

1. Wait patiently for a helper to come along.
2. Once someone helps you, say thank you and close the thread with:

+close

3. Feel free to nominate the person for helper of the week in #helper-nominations
4. Do not ping the mods, unless someone is breaking the rules.
5. If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[slow wing]

well you do know what induction is right?

you can do it for the base case, i assume, as it is pretty easy

@bold stump

[bold stump]

im confuse

[slow wing]

can you do the base case

assume for p(k) then try proving p(k+1) (hint: ||p(k+1)-p(k) is easily shown to be divisible by 4||)

[bold stump]

tht 1 yes

idk how to do the n=k+1 part only

for the n=1 and n=k i know

[slow wing]

click the hint