HA6 - Proof with algebra
Learn to represent arbitrary integers and construct algebraic proofs about odd, even and divisible numbers. This develops the general proofs in HA6, including stating why a factor proves divisibility and using a counterexample to reject a false universal claim.
Representing integers
Is the product of any two odd integers odd, even when one is negative? Examples suggest an answer, but a proof must include every allowed pair. We need expressions that represent those pairs without choosing particular numbers.
An even integer can be written , where is an integer. An odd integer can be written : one more than an even integer. Negative integers are included; for , these expressions give and .
General integer representations
With integer parameters:
| Integers described | General representation |
|---|---|
| Any integer | |
| Any even integer | |
| Any odd integer | |
| Three consecutive integers | |
| Three consecutive even integers | |
| Three consecutive odd integers |
Consecutive integers differ by and alternate between even and odd. Consecutive odd integers differ by , since an even integer lies between them. The letter must be declared an integer: need not be even if is allowed to be, for example, .
Worked example 1: consecutive integers
Question. Write and simplify an expression for the sum of three consecutive integers, starting with .
Plan. Represent the next two integers by adding and , then collect terms.
Answer. , where is any integer.
Check. At , the integers are , with sum . The expression gives .
Now require all three integers to be odd. The step becomes , so would no longer represent the required list.
Worked example 2: consecutive odd integers
Question. Write and simplify the sum of three consecutive odd integers, starting with .
Plan. Add for each next odd integer, keeping the same integer parameter.
Answer. , where is an integer.
Check. With , the odd integers are , whose sum is . The expression gives .
Two arbitrary odd integers need not be consecutive or equal. Represent them by and , with independent integers . Using the same expression twice would cover only equal odd integers.
Watch out
are consecutive integers, but the middle one is even. Three consecutive odd integers require gaps of : .
Start at a different odd expression and keep the step correct.
Divisibility and parity
A proof connects a general representation to the property being claimed. Expanding alone may be unfinished: your conclusion must explain what the final form guarantees.
Divisibility and parity
An integer is divisible by a positive integer when it equals times an integer. Its parity means whether it is even or odd. A form is even and is odd when is an integer. Zero and negative multiples count: and .
For example, a result is a multiple of because is an integer whenever is an integer. The factor supplies the divisor; the integer bracket supplies the quotient.
Worked example 3: a sum of odd integers
Question. Prove that the sum of any two odd integers is even.
Plan. Use independent integer parameters for the two odd integers and show their sum is twice an integer.
Let the odd integers be and , where are integers.
Answer. Since is an integer, the sum is twice an integer and is therefore even.
Check. The odd integers and have sum . This illustrates the result; the algebra covers every pair.
Keep the same two arbitrary odd integers but change the operation to multiplication. The target form is now one more than twice an integer.
Worked example 4: a product of odd integers
Question. Prove that the product of any two odd integers is odd.
Plan. Expand the product, then isolate an even expression plus .
For integers :
Answer. is an integer, so the product is of the form and is odd. This answers the opening question for negative as well as positive odd integers.
Check. , an odd integer.
For divisibility by a number other than , use the same final step: expose that number as a factor and justify the integer quotient.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account