- #1
spanker1
- 1
- 0
help guys i am really stumped on this question.
prove that
if "n" is an integer , then n^2-n+2 is even
prove that
if "n" is an integer , then n^2-n+2 is even
to prove by principle of mathemetical induction
step 1:
put n=1
1^2-1+2=1^3=1
which is false
help guys i am really stumped on this question.
prove that
if "n" is an integer , then n^2-n+2 is even
help guys i am really stumped on this question.
prove that
if "n" is an integer , then n^2-n+2 is even