Mathematica Is Mathematical Induction Sufficient to Prove n^2-n+2 Is Even for All Integers?

[spanker1]

help guys i am really stumped on this question.
prove that

if "n" is an integer , then n^2-n+2 is even

 

[disregardthat]

Suppose n is odd. What can you say about each member of n^2-n+2 ?
Suppose n is even. What can you say about each member of n^2-n+2?

 

[Tedjn]

That is one way of thinking about the problem. If you want to do this via induction, however, what is the first step you need to take? Also, are you trying to prove that fact for n is any integer or just a positive integer?

 

[lizzie]

to prove by principle of mathemetical induction
step 1:
put n=1
1^2-1+2=1^3=1
which is false

 

[gunch]

to prove by principle of mathemetical induction
step 1:
put n=1
1^2-1+2=1^3=1
which is false

I think what is meant by n^2-n+2 is n^2 - n +2, not n^{2-n+2} as you seem to use.

 

[CRGreathouse]

help guys i am really stumped on this question.
prove that

if "n" is an integer , then n^2-n+2 is even

A proof by induction would take the following form:

1. For n = 1, n^2-n+2 is even.
(subproof)
2. Suppose n^2-n+2 is even. Then (n+1)^2-(n+1)+2 is even.
(subproof)
3. By induction (base case 1, inductive step 2), n^2-n+2 is even for all natural numbers n.

If you can fill in the subproofs you're done.

(If you really want all integers, of course, you'll have to prove them too -- maybe by induction on (-n)^2-(-n)+2.)

 

[aquariss]

:)

help guys i am really stumped on this question.
prove that

if "n" is an integer , then n^2-n+2 is even

hmm...My suggestion :

N^2 - N + 2
= N(N-1) + 2

For any integer N, if N is even , (N-1) is odd therefore N(N-1) is divisible by 2 and is an even #, so , N(N-1) + 2 is even

For any integer N, if N is odd , (N-1) is even therefore N(N-1) is divisible by 2 and is an even #, so , N(N-1) + 2 is even

Is this logical?

 

[qspeechc]

For n=1, n^2 - n +2 = 2 is even.

Now, suppose that for some integer k, that k^2 -k + 2 is even. Then for the next integer k+1

(k+1)^2 -(k+1) +2 = k^2 + 2k +1 - k -1 +2 = k^2 + k +2

Now

k^2 + k + 2 = (k^2 -k + 2) + 2k

On the RHS, the stuff in bracket is what we started with, we assumed it was even. 2k is even for all integers k. An even number plus an even number is an even number. Therefore for the next integer, it will also be even.

Therefore for all integers n, n^2 -n +2 is even

 

[sennyk]

Quick question about induction. Could you prove it true for n = 1. Then prove it for n = n + 1. Then prove it for n = n - 1. Would that be enough to prove it for all integers?