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 and . Both are divisible by . Is divisible by for every integer , 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 , represents an even integer and an odd integer.
The integer condition matters. If , then , which is not an even integer. Consecutive integers are , and ; consecutive odd integers differ by . 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 be any integer.
Why factor out ? Being twice an integer is exactly what “even” means.
Answer. Since is an integer, the sum is even for every integer .
Check. Take : the numbers are and , with even sum . This supports the proof but does not replace it.
Change only the parity of the two consecutive numbers. Consecutive even integers still differ by .
Worked example 2: consecutive even integers
Question. Prove that the sum of two consecutive even integers is even.
Plan. Use and , then factor their sum.
For any integer ,
Why use one variable? It guarantees the second number is exactly more than the first.
Answer. The sum is even because is an integer.
Check. With , , agreeing with .
The representation must encode the relationship as well as the type of number.
Watch out
Wrong: “Consecutive odd integers are and , for any integer .” This includes even pairs. Correct: use and , with an integer.
Now change the gap to , so the pair is consecutive integers of different parity.
Proving divisibility (Higher)
An integer is divisible by a positive integer if it equals times an integer. Factorisation often reveals this. For example, is even: if is even it supplies a factor ; if is odd, supplies it.
Three consecutive integers include a multiple of . Their remainders on division by run through , and , 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 is divisible by for every integer .
Plan. Factor into consecutive integers and identify factors and .
Among these three consecutive integers, at least one is even and at least one is a multiple of .
Why does that give ? The factors and have no common factor greater than , so their product divides the expression.
Answer. The product, and hence , is divisible by for every integer .
Check. At , . At , the result is , 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 is divisible by for every integer .
Plan. Factor the polynomial to reveal three consecutive integers.
These three consecutive integers contain an even factor and a factor divisible by .
Why factor instead of checking values? The consecutive structure proves both divisibility statements for every integer input.
Answer. Since and are coprime, the product is divisible by .
Check. At , , a multiple of .
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