2.2 - Constructing algebraic proofs

2.2 - Constructing algebraic proofs

Use algebra to show that a claim holds for every permitted value. You will represent whole families of numbers, reveal factors and prove identities. You will also see why one failed case can settle a question that a thousand successful checks cannot.

Representing a general claim (Higher)

A calculator gives 43−4=604^3-4=60 and 53−5=1205^3-5=120. Both are divisible by 66. Is n3−nn^3-n divisible by 66 for every integer nn, including negative integers? We need an argument that covers them all.

You already know

An integer is a whole number, including zero and negative whole numbers. Factorising rewrites a sum as a product without changing its value.

Checking examples suggests a pattern. It does not prove an infinite claim: an untested value could behave differently. A variable lets one calculation represent every allowed case.

Proof

A chain of valid reasoning establishing a claim for every case in its stated domain, the set of allowed values. For an arbitrary integer nn, 2n2n represents an even integer and 2n+12n+1 an odd integer.

The integer condition matters. If n=14n=\frac14, then 2n=122n=\frac12, which is not an even integer. Consecutive integers are nn, n+1n+1 and n+2n+2; consecutive odd integers differ by 22. These representations and proof methods are absent from the Higher formulae sheet: learn to construct them.

Worked example 1: consecutive odd integers

Question. Prove that the sum of two consecutive odd integers is even.

Plan. Represent both numbers using one arbitrary integer, then show their sum is twice an integer.

Let nn be any integer.

numbers=2n+1, 2n+3odd, separated by 2sum=(2n+1)+(2n+3)add the numbers=4n+4=2(2n+2)expose a factor 2\begin{aligned} \text{numbers}&=2n+1,\ 2n+3 &&\text{odd, separated by }2\\ \text{sum}&=(2n+1)+(2n+3) &&\text{add the numbers}\\ &=4n+4=2(2n+2) &&\text{expose a factor }2 \end{aligned}

Why factor out 22? Being twice an integer is exactly what “even” means.

Answer. Since 2n+22n+2 is an integer, the sum is even for every integer nn.

Check. Take n=−2n=-2: the numbers are −3-3 and −1-1, with even sum −4-4. This supports the proof but does not replace it.

Change only the parity of the two consecutive numbers. Consecutive even integers still differ by 22.

Worked example 2: consecutive even integers

Question. Prove that the sum of two consecutive even integers is even.

Plan. Use 2n2n and 2n+22n+2, then factor their sum.

For any integer nn,

sum=2n+(2n+2)represent every pair=4n+2collect terms=2(2n+1)factor 2\begin{aligned} \text{sum}&=2n+(2n+2) &&\text{represent every pair}\\ &=4n+2 &&\text{collect terms}\\ &=2(2n+1) &&\text{factor }2 \end{aligned}

Why use one variable? It guarantees the second number is exactly 22 more than the first.

Answer. The sum is even because 2n+12n+1 is an integer.

Check. With n=3n=3, 6+8=146+8=14, agreeing with 2(7)2(7).

The representation must encode the relationship as well as the type of number.

Watch out

Wrong: “Consecutive odd integers are nn and n+2n+2, for any integer nn.” This includes even pairs. Correct: use 2n+12n+1 and 2n+32n+3, with nn an integer.

Now change the gap to 11, so the pair is consecutive integers of different parity.

Proving divisibility (Higher)

An integer is divisible by a positive integer kk if it equals kk times an integer. Factorisation often reveals this. For example, n(n+1)n(n+1) is even: if nn is even it supplies a factor 22; if nn is odd, n+1n+1 supplies it.

Three consecutive integers include a multiple of 33. Their remainders on division by 33 run through 00, 11 and 22, in some order. These arguments also include negative integers and zero. No divisibility proof rule is supplied on the Higher formulae sheet.

Worked example 3: the opening claim

Question. Prove that n3−nn^3-n is divisible by 66 for every integer nn.

Plan. Factor into consecutive integers and identify factors 22 and 33.

n3−n=n(n2−1)take out n=(n−1)n(n+1)difference of squares\begin{aligned} n^3-n&=n(n^2-1) &&\text{take out }n\\ &=(n-1)n(n+1) &&\text{difference of squares} \end{aligned}

Among these three consecutive integers, at least one is even and at least one is a multiple of 33.

Why does that give 66? The factors 22 and 33 have no common factor greater than 11, so their product divides the expression.

Answer. The product, and hence n3−nn^3-n, is divisible by 66 for every integer nn.

Check. At n=−2n=-2, −8+2=−6=6(−1)-8+2=-6=6(-1). At n=0n=0, the result is 0=6×00=6\times0, also a multiple.

Shift the block of three consecutive integers one place to the right. The factor argument stays the same, even though the expanded polynomial looks different.

Worked example 4: a shifted consecutive product

Question. Prove that n3+3n2+2nn^3+3n^2+2n is divisible by 66 for every integer nn.

Plan. Factor the polynomial to reveal three consecutive integers.

n3+3n2+2n=n(n2+3n+2)common factor n=n(n+1)(n+2)factor the quadratic\begin{aligned} n^3+3n^2+2n&=n(n^2+3n+2) &&\text{common factor }n\\ &=n(n+1)(n+2) &&\text{factor the quadratic} \end{aligned}

These three consecutive integers contain an even factor and a factor divisible by 33.

Why factor instead of checking values? The consecutive structure proves both divisibility statements for every integer input.

Answer. Since 22 and 33 are coprime, the product is divisible by 66.

Check. At n=2n=2, 8+12+4=24=2×3×48+12+4=24=2\times3\times4, a multiple of 66.

Combining factors needs care when they overlap.

Continue this lesson.

You’re previewing NovaLearn without an account. Create a free account to read the rest.

Create free account