Skip to main content
Mathematics

Return to Answer

added 36 characters in body
Source Link
Nick
Nick
  • 198
  • 1
  • 7

Your proof is correct. There is only one thing I would clean up.

After establishing $N > m$ and that $P(j)$$P(k)$ is true for all $j < N$$k < N$, just immediately apply (b) to get P(N) is true (Here $N$ is playing the role of $k$, and $k$ is playing the role of $j$).

Your proof is correct. There is only one thing I would clean up.

After establishing $N > m$ and that $P(j)$ is true for all $j < N$, just immediately apply (b) to get P(N) is true (Here $N$ is playing the role of $k$).

Your proof is correct. There is only one thing I would clean up.

After establishing $N > m$ and that $P(k)$ is true for all $k < N$, just immediately apply (b) to get P(N) is true (Here $N$ is playing the role of $k$, and $k$ is playing the role of $j$).

Source Link
Nick
Nick
  • 198
  • 1
  • 7

Your proof is correct. There is only one thing I would clean up.

After establishing $N > m$ and that $P(j)$ is true for all $j < N$, just immediately apply (b) to get P(N) is true (Here $N$ is playing the role of $k$).