VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Algebraic Proof With Even, Odd and Consecutive Integers

Three learners review open books together at a classroom table, with stacks of textbooks, stationery and a whiteboard in the bright room.

Is the sum of two odd integers always even?

Examples suggest yes:

  • 3+5=8;
  • 7+11=18;
  • 21+9=30.

But examples are not a proof.

An algebraic proof replaces particular examples with a general representation that covers every allowed case at once.

Let two odd integers be:

2m+1 and 2n+1.

Their sum is:

(2m+1)+(2n+1)=2m+2n+2.

Factor:

2(m+n+1).

This is 2 times an integer, so the sum is even.

The quick answer: represent the whole class, then expose the defining form

  1. Represent an arbitrary integer using a variable.
  2. Use the defining algebraic form for even, odd or consecutive integers.
  3. Carry out the required operation.
  4. Rearrange the result until the target property is visible.
  5. State why that final form proves the claim for every allowed case.

Even integers have the form 2n

An integer is even exactly when it is divisible by 2.

So an arbitrary even integer can be represented as:

2n

where n is an integer.

This representation covers:

  • …, −6, −4, −2, 0, 2, 4, 6, …

Odd integers have the form 2n+1

An odd integer is one more than an even integer.

So:

2n+1.

Equivalent forms such as 2n−1 also represent all odd integers as n ranges over the integers.

Consecutive integers

If n is an integer, then consecutive integers can be written:

n, n+1, n+2, …

Consecutive even integers can be written:

2n, 2n+2, 2n+4.

Consecutive odd integers can be written:

2n+1, 2n+3, 2n+5.

The spacing is part of the structure.

Prove: even + even is even

Let the even integers be 2m and 2n.

Sum:

2m+2n=2(m+n).

Since m+n is an integer, the result is 2 times an integer.

Therefore the sum is even.

Prove: odd + odd is even

Let the odd integers be 2m+1 and 2n+1.

Sum:

2m+1+2n+1=2(m+n+1).

Therefore even.

Prove: odd + even is odd

Let odd=2m+1 and even=2n.

Sum:

2m+1+2n=2(m+n)+1.

This is of the form 2k+1, so it is odd.

The proof succeeds when the final expression matches the definition of the property being proved.

Prove: even × any integer is even

Let even integer=2m and arbitrary integer=n.

Product:

(2m)n=2(mn).

Since mn is an integer, the product is even.

Prove: odd × odd is odd

Let the odd integers be 2m+1 and 2n+1.

Product:

(2m+1)(2n+1).

Expand:

4mn+2m+2n+1.

Factor 2 from the first three terms:

2(2mn+m+n)+1.

Therefore the product is odd.

Prove: square of an odd integer is odd

Let odd=2n+1.

Square:

(2n+1)²=4n²+4n+1.

=2(2n²+2n)+1.

So the square is odd.

Consecutive integers often produce divisibility

Prove that the sum of two consecutive integers is odd.

Let them be n and n+1.

Sum:

n+(n+1)=2n+1.

Therefore odd.

Three consecutive integers

Prove that the sum of three consecutive integers is divisible by 3.

Let them be:

n, n+1, n+2.

Sum:

3n+3=3(n+1).

So the sum is divisible by 3.

The middle integer becomes the average

For n−1, n, n+1:

sum=3n.

Average=3n/3=n.

The middle of three consecutive integers is their arithmetic mean.

Algebra exposes this symmetry instantly.

Prove a difference is even

Let a and b be odd integers:

a=2m+1, b=2n+1.

Difference:

a−b=2m+1−2n−1=2(m−n).

So the difference of two odd integers is even.

Proof by factorisation

Prove that the difference between the squares of two consecutive integers is odd.

Let the integers be n and n+1.

Difference:

(n+1)²−n².

Expand:

n²+2n+1−n²=2n+1.

Therefore odd.

Alternatively factor as a difference of squares:

[(n+1)−n][(n+1)+n]=1(2n+1).

Same conclusion.

Examples can suggest a conjecture but cannot prove a universal claim

Testing 1, 3, 5, 7 and 9 may strongly suggest a parity pattern.

But a claim about every integer needs a general argument unless the set itself is finite and exhaustively checked.

Examples answer “Does this happen here?” Proof answers “Why must this happen for every case covered by the claim?”

One counterexample can disprove a universal claim

Claim:

“The sum of any two prime numbers is even.”

Counterexample:

2+3=5, which is odd.

The universal claim is false.

This illustrates an important asymmetry:

  • many examples cannot prove a universal statement;
  • one valid counterexample can disprove it.

Do not use the same variable for two independent arbitrary integers

If two arbitrary even integers are represented as 2n and 2n, you have accidentally assumed they are equal.

Use:

2m and 2n

unless the proof specifically requires the same integer.

Consecutive integers should use one base variable

For consecutive integers, n and n+1 are linked by definition.

Using unrelated m and n would lose the consecutive relationship.

The representation must preserve exactly the condition in the claim.

State the integer condition

Writing 2n is only an even integer representation when n is itself an integer.

A complete proof should state:

“Let n be an integer.”

This closes a logical gap that can otherwise be hidden by familiar notation.

The final line needs interpretation

Suppose the algebra ends at:

2(m+n+1).

Do not stop there.

State:

“Since m+n+1 is an integer, the expression is twice an integer; therefore it is even.”

The proof is a reasoning chain, not only symbolic manipulation.

Common misconception 1: three examples prove the result

Examples support conjecture, not universal proof.

Common misconception 2: represent an odd integer as 2n

2n is even. Use 2n+1 or another equivalent odd form.

Common misconception 3: two arbitrary numbers can share one variable

That can unintentionally force them to be equal.

Common misconception 4: algebraic simplification alone is the proof conclusion

Explain why the final form has the required property.

A proof diagnostic ladder

  1. Can the learner represent arbitrary even and odd integers?
  2. Can the learner represent consecutive integers?
  3. Can the learner distinguish arbitrary from consecutive variables?
  4. Can the learner expand and factor accurately?
  5. Can the learner expose 2k or 2k+1 forms?
  6. Can the learner state why k is an integer?
  7. Can the learner separate examples from proof?
  8. Can the learner use a counterexample to disprove a claim?
  9. Can the learner write a complete concluding sentence?
  10. Can the learner generalise the proof to unfamiliar parity statements?

How this fits Secondary Mathematics

Algebraic proof connects number properties, expansion, factorisation, identities and logical reasoning. It moves algebra from “find x” toward “show why this relationship must always hold”.

Exact proof requirements differ by subject level and course, so current G3 and Additional Mathematics syllabuses should be checked for formal assessment scope.

The deeper lesson: proof replaces the list with the structure

Examples show the pattern many times.

Algebraic proof shows the mechanism once, in a form broad enough to contain every case.

A proof becomes general when the variables are arbitrary, the representation preserves the stated conditions, and the final algebra exposes the defining structure that makes the conclusion unavoidable.

Sources and further reading