Transcript Slide 1

Year 9 Proof
Dr J Frost ([email protected])
Objectives: Understand what is meant by a proof, and examples of
what does and what doesn’t constitute a proof.
Be able to solve problems involving sequences, consecutive
numbers and involving digits.
Last modified: 19th February 2015
How Many Examples Needed?
In 1772 Euler noticed that the following equation
gives prime numbers for many positive integers n:
π’πŸ – 𝒏 + πŸ’πŸ
We might wonder if the statement β€œFor all positive
integers n, n2 – n + 41 is prime” is true.
Try this for a few 𝒏. How many examples of n
would we need to show this statement is:
a) True
One 
A few 
Infinitely
οƒΌ many
b) False
One οƒΌ
A few 
Infinitely
many
The smallest value of 𝑛 for which this statement is false is: 41?
Counterexamples
! A counterexample is an example used to disprove a statement.
Discussing in pairs, find counterexamples for the following statements:
1
Statement
Possible counterexample
Prime numbers are always
odd.
2 is prime, but not odd.
The square root of a number is
2 always smaller than the
number itself.
3
If 𝑝 is prime then 𝑝 + 2 is
prime.
2𝑛2 + 11 is prime for all
4 integer values of 𝑛
?
0.25 = 0.5, but 0.5 > 0.25.
?
7 is prime but 9 is not.
?
(2 × 112 ) + 11 will be
divisible by 11 ?
because 2 ×
2
11 and 11 both are.
SKILL #1: Sequence Proofs
1st
2nd
3rd
4th
5th
5
4
9 13 22 35 57
2
6
8 14 22 36 58
Each of the numbers is the sum of the two numbers to the left.
You get to set the first 2 numbers (indicated in black).
a) Try a few starting numbers, can you discover a rule that allows
you to quickly work out the last (5th) number given the first
two, without having to work out the ones in between?
b) In this example we had 5 squares after the first two. Can you
generalise your rule to work for any number of squares?
Solution
! To represent something generically, use an algebraic variable.
a
?
?
?
?
b a+b
a+2b
2a+3b
3a+5b
5a +? 8b
Our rule could be this: The last number is 5 times the first one
plus 8 times the second one.
Generify! For the nth square, we multiply the first number by the
nth Fibonacci
? number and the second number by the
(n+1)th Fibonacci
? number, and add the results.
Exercise 1
Q1
Q2
Find a rule which gives you the orange number given the
black numbers(s).
6
5
a
b
1
4 -3 7 -10
a-b
2b-a
?
2a-3b
5b-3a
Q3
5a-8b
[Cayley] The first two terms of a sequence are the numbers 1, 2. From
then on, each term is obtained by dividing the previous term by the
term before that. Thus the third term is obtained by dividing the second
term, 2, by the first term, 1.
(a)
Write down the first five terms.
?
𝟏, 𝟐, 𝟐, 𝟏,
(b)
𝟏
𝟐
Calculate the fiftieth term.
𝟏 𝟏
Terms repeat every six: 𝟏, 𝟐, 𝟐, 𝟏, 𝟐 , 𝟐 , 𝟏, 𝟐, …
𝟏
?
𝟏
If 6th term is 𝟐, then 48th term is 𝟐, and so 50th term is 𝟐.
(c)
What happens if other non-zero numbers are chosen for the first
two terms, but the rule for calculating the next term remains the
same? (Not, you must prove this behaviour in general!)
If first two numbers are 𝒂, 𝒃. Then subsequent numbers are
𝒃 𝟏 𝟏 𝒂
, , , , 𝒂, 𝒃, …
𝒂 𝒂 𝒃 𝒃
Since each term is based only on the previous
?
two, we have proved the sequence always cycles every 6
numbers for any two starting numbers.
N
The first and second terms of a sequence are added to
make the third term. Adjacent odd-numbered terms are
added to make the next even-numbered term, for
example,
First term + third term = fourth term
And
third term + fifth term = sixth term
Likewise, adjacent even-numbered terms are added to
make the next odd-numbered term, for example,
Second term + fourth term = fifth term
Given that the seventh term equals the eighth term,
what is the value of the sixth term?
Terms are 𝒂, 𝒃, 𝒂 + 𝒃, πŸπ’‚ + 𝒃, πŸπ’‚ + πŸπ’ƒ, πŸ‘π’‚ + πŸ‘π’ƒ, πŸ“π’‚ +
πŸ’π’ƒ, πŸ•π’‚ + πŸ”π’ƒ
Since 7th term = 8th term, πŸ“π’‚ + πŸ’π’ƒ = πŸ•π’‚ + πŸ”π’ƒ.
Therefore 𝒂 = βˆ’π’ƒ
Thus sixth term is πŸ‘π’‚ + πŸ‘π’ƒ = βˆ’πŸ‘π’ƒ + πŸ‘π’ƒ = 𝟎
[Hamilton] The first two terms of a sequence are the
numbers 1, 2. From then on, each term is obtained by
adding 1 to the previous term and then dividing by the
term before that. Thus the third term is obtained by adding
1 to the second term and then dividing by the first term.
a. Write down the first five terms.
𝟏, 𝟐, πŸ‘, 𝟐, 𝟏
b. Calculate the sixtieth term.
Continuing, 6th term is 1 and 7th is 2. So sequence
repeats every 5 terms. If 5th term is 1, the 60th term is
also 1.
c. What happens if the other non-zero numbers are
chosen for the first two terms, but the rule for
calculating the next term remains the same?
?
?
?
If first two terms are 𝒂 and 𝒃, then we get
𝒃+𝟏 𝒃+𝟏+𝒂 𝒂+𝟏
?
𝒂, 𝒃, 𝒂 , 𝒂𝒃 , 𝒃 , 𝒂, 𝒃. This requires some fairly
difficult algebraic simplification!
Reasoning about
sides and angles.
Introducing variables
for unknowns.
Algebraic
Geometric
Some types of proofs
Games
If I have a β€˜perfect
Connect 4’ strategy
for winning, how can
I show it’s perfect?
Even/odd
e.g. β€œShow that n2 + n is
always even.”
SKILL #2: Divisibility Proofs
Show that the sum of any three consecutive integers is a multiple of 3.
Kyle’s proof:
β€œ5 + 6 + 7 = 18, which is divisible by 3”.
We could represent 3 consecutive integers as:
𝒏
𝒏+𝟏 𝒏+𝟐
?
Then:
𝒏+ 𝒏+𝟏 + 𝒏+𝟐
= πŸ‘π’ + πŸ‘
= πŸ‘(𝒏 +?𝟏)
which is divisible by 3.
Que Problemo?
He hasn’t shown it’s
true for all?
possible
integers.
SKILL #2: Divisibility Proofs
How could I algebraically represent:
!
An odd number
2π‘˜?+ 1
An even number
2π‘˜
?
Two consecutive odd numbers
2π‘˜ + 1,
?
2π‘˜ + 3
(but 2π‘˜ βˆ’ 1 and 2π‘˜ + 1 might make
your subsequent algebra easier)
The sum of the squares of two
consecutive numbers.
A power of 2.
One less than a multiple of 5.
π‘˜2 + π‘˜ + 1
?
2?π‘˜
5π‘˜?βˆ’ 1
2
Check Your Understanding
Prove that the sum of three consecutive even numbers is a multiple
of 6.
2𝑛 + 2𝑛 + 2 + 2𝑛 + 4
= 6𝑛 + 6
= 6(𝑛 + 1) ?
which is a multiple of 6.
Prove that the product of two consecutive odd numbers is always
one less than a multiple of 4.
2𝑛 + 3 2𝑛 + 1
= 4𝑛2 + 8𝑛 + 3
= 4 𝑛2 + 2𝑛 + 3
Which is 3 more than a multiple of 4, i.e. 1 less than a multiple of 4.
Alternatively:
?
2𝑛 + 1 2𝑛 βˆ’ 1
= 4𝑛2 βˆ’ 1
Which is clearly one less than a multiple of 4.
Exercise 2
Q1
Prove algebraically that the sum of two consecutive odd
numbers is divisible by 4.
πŸπ’™ + 𝟏 + πŸπ’™ + πŸ‘
= πŸ’π’™ + πŸ’ = πŸ’(𝒙 + 𝟏)
N1
?
Q2
[GCSE] I think of two consecutive integers. Prove that the
difference of the squares of these integers is equal to the
sum of the two integers.
Two numbers are: 𝒙 and 𝒙 + 𝟏
Difference of squares: 𝒙 + 𝟏 𝟐 βˆ’ π’™πŸ = πŸπ’™ + 𝟏
Sum of numbers: 𝒙 + 𝒙 + 𝟏 = πŸπ’™ + 𝟏
These are equal.
?
Q3
𝒏 + 𝟏 πŸ‘ βˆ’ π’πŸ‘
= π’πŸ‘ + πŸ‘π’πŸ + πŸ‘π’ + 𝟏 βˆ’ π’πŸ‘
= πŸ‘π’πŸ + πŸ‘π’ + 𝟏
= πŸ‘π’ 𝒏 + 𝟏 + 𝟏
The product of two consecutive integers is even,
thus πŸ‘π’(𝒏 + 𝟏) is divisible by 6.
?
N2
Prove that the difference between the squares of two
odd numbers is a multiple of 8.
πŸπ’ + 𝟏 𝟐 βˆ’ πŸπ’ βˆ’ 𝟏 𝟐
= πŸ’π’πŸ + πŸ’π’ + 𝟏 βˆ’ πŸ’π’πŸ βˆ’ πŸ’π’ + 𝟏
= πŸ’π’πŸ + πŸ’π’ + 𝟏 βˆ’ πŸ’π’πŸ + πŸ’π’ βˆ’ 𝟏
= πŸ–π’
which is divisible by 8.
[JMO] Find a rule which predicts exactly when five
consecutive integers have sum divisible by 15.
𝒏+ 𝒏+𝟏 + 𝒏+𝟐 + 𝒏+πŸ‘ + 𝒏+πŸ’
= πŸ“π’ + 𝟏𝟎
= πŸ“(𝒏 + 𝟐)
Thus to be divisible by 15, 𝒏 + 𝟐 must be divisible by 3,
i.e. the middle number of the five numbers must be
divisible by 3.
?
[IMO] Prove that there is exactly one
sequence of five consecutive positive
integers in which the sum of the squares of
the first three integers is equal to the sum
of the squares of the other two integers.
𝒙 βˆ’ 𝟏 𝟐 + π’™πŸ + 𝒙 + 𝟏 𝟐
= 𝒙+𝟐 𝟐+ 𝒙+πŸ‘ 𝟐
πŸ‘π’™πŸ + 𝟐 = πŸπ’™πŸ + πŸπŸŽπ’™ + πŸπŸ‘
π’™πŸ βˆ’ πŸπŸŽπ’™ βˆ’ 𝟏𝟏 = 𝟎
𝒙 + 𝟏 𝒙 βˆ’ 𝟏𝟎 = 𝟎
𝒙 = βˆ’πŸ 𝒐𝒓 𝒙 = 𝟏𝟎
So πŸ—πŸ + 𝟏𝟎𝟐 + 𝟏𝟏𝟐 = 𝟏𝟐𝟐 + πŸπŸ‘πŸ is only
solution.
?
?
Q4
Prove that the difference between two
consecutive cubes is one more than a
multiple of 6.
N3
Prove that the product of four consecutive
numbers is one less than a square number.
𝒂 𝒂+𝟏 𝒂+𝟐 𝒂+πŸ‘
= π’‚πŸ + 𝒂 π’‚πŸ + πŸ“π’‚ + πŸ”
= π’‚πŸ’ + πŸ”π’‚πŸ‘ + πŸπŸπ’‚πŸ + πŸ”π’‚ + 𝟏
?
= π’‚πŸ + πŸ‘π’‚ + 𝟏
𝟐
SKILL #3: Digit Proofs
β€œI think of a two-digit number. I then reverse the
digits. Prove that the difference between the two
numbers is a multiple of 9”
e.g. 71 – 17 = 54
Let β€œab” be a two digit number. Then its reverse is β€œba”.
The value of each
number
is 10π‘ŽAlgebraically
+ 𝑏 and 10𝑏 +?π‘Ž
Model
Problem
respectively.
Thus their difference is 10π‘Ž + 𝑏 βˆ’ 10𝑏 + π‘Ž = 9π‘Ž βˆ’ 9𝑏
βˆ’ 𝑏)conclusion
(Note how factoring
Manipulate =to9(π‘Ž
reach
? out the 9 is a
good explicit way to show the
which is a multiple of 9.
expression is a multiple of 9)
Test Your Understanding
a
What would be the value of the 4-digit number with digits "π‘Žπ‘π‘π‘‘β€?
πŸπŸŽπŸŽπŸŽπ’‚ + πŸπŸŽπŸŽπ’ƒ + πŸπŸŽπ’„ + 𝒅
b
What would be the value if its digits were reversed?
πŸπŸŽπŸŽπŸŽπ’… + πŸπŸŽπŸŽπ’„
? + πŸπŸŽπ’ƒ + 𝒂
?
c
What is the sum of these two numbers?
πŸπŸŽπŸŽπŸπ’‚ + πŸπŸπŸŽπ’ƒ?+ πŸπŸπŸŽπ’„ + πŸπŸŽπŸŽπŸπ’…
d
Hence prove that the sum of a four digit number and its reverse is a multiple of 11.
= 𝟏𝟏(πŸ—πŸπ’‚ + πŸπŸŽπ’ƒ
? + πŸπŸŽπ’„ + πŸ—πŸπ’…)
Rubbish Proofs
Darth Kitty’s solution:
β€œPick the number 31 for example. The
reverse of this is 13. And
31 – 13 = 18, which is divisible by 9.
Hence the statement is true.”
What is wrong with their proof?
Showing something is true for one example
is not sufficient. We need to show the
? POSSIBLE starting
statement is true for ANY
number we choose.
Rubbish Proofs
Photoshop Kitty’s solution:
β€œHere’s all possible two-digit
numbers:
11 – 11 = 0, 12 – 12 = 0, ...
21 – 12 = 9, 22 – 22 = 0, 32 – 23 = 9, 42 – 24 = 18, ...
98 – 89 = 9, 99 – 99 = 0
These are all divisible by 9.
What is wrong with their proof?
Technically it’s a valid proof, because we’ve
shown the statement is true for every
possible two-digit number. But it’s bad maths
having to list out every?case, and would
become difficult if for example we tried to
generalise the statement to 3-digit numbers.
Proof of 9 divisibility rule
Prove for 2-digit numbers that if the sum of the digits of a number is a
multiple of 9, then the number itself is divisible by 9.
How to represent a two digit number 𝑛 with digits "π‘Žπ‘":
𝑛 = πŸπŸŽπ’‚ + 𝒃
?
How do we represent property that digits add up to a multiple of 9?
𝒂 + 𝒃 = πŸ—π’Œ
?
How do we combine these equations to therefore show that the original number 𝑛
is a multiple of 9?
𝒏 = πŸπŸŽπ’‚ + 𝒃
= πŸ—π’‚ + 𝒂 + 𝒃
= πŸ—π’‚ +?πŸ—π’Œ
=πŸ— 𝒂+π’Œ
Hence 𝒏 is divisible by 9.
Exercise 3 – Digit Problems
[JMO] Observe that 49 = 4 x 9 + 4 + 9
I think of a 3-digit number and then reverse its digits.
Q1 Prove that the difference between these two numbers 4 Use algebra to find all other two-digit numbers
which are equal to the product of their digits plus
the sum of their digits.
is a multiple of 11.
If a number has the digits β€œπ’‚π’ƒπ’„β€ then its reverse is "π’„π’ƒπ’‚β€œ.
Each number has the value πŸπŸŽπŸŽπ’‚ + πŸπŸŽπ’ƒ + 𝒄 and πŸπŸŽπŸŽπ’„ +
πŸπŸŽπ’ƒ + 𝒂.
πŸπŸŽπŸŽπ’‚ + πŸπŸŽπ’ƒ + 𝒄 βˆ’ πŸπŸŽπŸŽπ’„ + πŸπŸŽπ’ƒ + 𝒂
= πŸ—πŸ—π’‚ βˆ’ πŸ—πŸ—π’„ = 𝟏𝟏 πŸ—π’‚ βˆ’ πŸ—π’„
πŸπŸŽπ’‚ + 𝒃 = 𝒂𝒃 + 𝒂 + 𝒃
πŸ—π’‚ = 𝒂𝒃
Given 𝒂 is not 0:
πŸ—=𝒃
Thus numbers are πŸπŸ—, πŸπŸ—, … , πŸ—πŸ—
?
[IMO] All the digits of a certain positive three-digit
Q2 number are non-zero. When the digits are taken in
?
Prove that there are no three-digit numbers
b which are equal to the product of their digits plus
the sum of their digits.
reverse order a different number is formed. The
difference between the two numbers is divisible by
eight. Given that the original number is a square
number, find its possible values.
Difference of β€œπ’‚π’ƒπ’„β€ and "π’„π’ƒπ’‚β€œ is πŸ—πŸ—(𝒂 βˆ’ 𝒄)
Since 99 is not divisible by 8, 𝒂 βˆ’ 𝒄 is. Only possible if 𝒂 =
𝟏, 𝒄 = πŸ— or vice versa. Only square in former case is 169.
Only square in latter case is 961.
?
[IMO] An β€˜unfortunate’ number is a positive integer
Q3 which is equal to 13 times the sum of its digits. Find all
β€˜unfortunate’ numbers. (Hint: start with 2 digit first)
For two-digit πŸπŸŽπ’‚ + 𝒃 = πŸπŸ‘ 𝒂 + 𝒃 β†’ πŸ‘π’‚ + πŸπŸπ’ƒ =
𝟎 which is impossible. Using same approach for 3digit: 117, 156, 195
Need to also show not possible for more than 3 digits.
?
πŸπŸŽπŸŽπ’‚ + πŸπŸŽπ’ƒ + 𝒄 = 𝒂𝒃𝒄 + 𝒂 + 𝒃 + 𝒄
πŸ—πŸ—π’‚ + πŸ—π’ƒ = 𝒂𝒃𝒄
But since 𝒃𝒄 is at most 81, πŸ—πŸ— > 𝒃𝒄 and thus
πŸ—πŸ—π’‚ > 𝒂𝒃𝒄 and hence the LHS is always greater.
?
5
N
Can you prove the 9 divisibility rule for 3 digit numbers?
A divisibility test for 7 is to subtract twice the last digit
from the remaining numbers, and see if the result is
divisible by 7. e.g. 392 -> 39 – 4 = 35, which is clearly
divisible by 7, so 392 is. Prove this works for all threedigit numbers.
Let our number be n with the digits β€œabc”.
𝒏 = πŸπŸŽπŸŽπ’‚ + πŸπŸŽπ’ƒ + 𝒄. If we subtract twice the last digit
from the remaining numbers, we get 10a + b – 2c. Now if
this is divisible by 7, 10a + b – 2c = 7k for some integer k.
Thus πŸπŸŽπŸŽπ’‚ + πŸπŸŽπ’ƒ βˆ’ πŸπŸŽπ’„ = πŸ•πŸŽπ’Œ
Then n = 100a + 10b + c = 70k + 21c = 7(10k + 3c) which is
divisible by 7.
?
Another Example of Good/Bad Proofs
[IMO] β€œAn arithmetic sequence is one in which the
difference between successive terms remains constant
(for example, 4, 7, 10, 13, …). Suppose that a rightangled triangle has the property that the lengths of its
sides form an arithmetic sequence. Prove that the
sides of the triangle are in the ratio 3:4:5.”
Example of a bad proof:
β€œIf the sides of the triangle are in the ratio
3:4:5, we could have any multiple of this.
e.g. 6, 8, 10. These are still in an
arithmetic sequence and satisfy
Pythagoras Theorem.”
Why is it bad?
We’re supposed to be showing that IF the sides
form an arithmetic sequence THEN the sides have
ratio 3:4:5. They’ve just shown the reverse!
?
What would a good proof look like?
Use our general structure for an algebraic
proof!
β€’ β€œAssume that the sides form an arithmetic
sequence.
β€’ Model this assumption,
? using algebraic
expressions for side lengths that represent
all possible arithmetic sequences, e.g. a-b,
a, a+b.
β€’ Do some manipulation using Pythagoras...
β€’ Therefore, the sides have ratio 3:4:5.”
QED
QED is short for the latin β€œQuad erat demonstrandum”.
?
It translates roughly to β€œWhich had to be
? demonstrated”.
It’s symbol in maths is β–‘ ?
I think of a two-digit number. I then reverse the digits. Prove that
the difference between the two numbers is a multiple of 9.
β€œLet the number have the digits β€˜ab’. Then the number is 10a + b.
If we reverse the digits to get β€˜ba’, which has the value 10b + a.
Subtracting to find the difference:
10a + b – (10b + a) = 9a – 9b = 9(a-b).
β–‘
9(a-b) is divisible by 9.”
β€˜Without loss of generality’
I think of a two-digit number. I then reverse the digits. Prove that
the difference between the two numbers is a multiple of 9.
β€œLet the number have the digits β€˜ab’. Then the number is 10a + b.
If we reverse the digits to get β€˜ba’, which has the value 10b + a.
Subtracting to find the difference:
10a + b – (10b + a) = 9a – 9b = 9(a-b).
β–‘
9(a-b) is divisible by 9.”
When we find the difference between two numbers we tend to do the bigger number
subtracting the smaller number. Here in our proof we did β€œπ‘Žπ‘β€βˆ’β€π‘π‘Žβ€. If this difference is
positive what have we assumed?
That 𝒂 β‰₯ 𝒃
?
If we stated this assumption that π‘Ž β‰₯ 𝑏, have we made our proof β€˜less general’, in the
sense that we’ve only now proved the property for restricted two-digit numbers where
the first digit is greater than (or equal to) the second?
No, it doesn’t matter, because if we had say πŸ“πŸ•, then after we’d reversed the digits to
get 75, we could have subtracted the other way round. The proof still implicitly covers
?
all two-digit numbers because the original number
and the reversed number are
interchangeable when we come to subtract.
β€˜Without loss of generality’
I think of a two-digit number. I then reverse the digits. Prove that
the difference between the two numbers is a multiple of 9.
β€œLet the number have the digits β€˜π‘Žπ‘β€™. With loss of generality, let
𝒂 > 𝒃. Then the number is 10π‘Ž + 𝑏.
If we reverse the digits to get β€˜ba’, which has the value 10b + a.
Subtracting to find the difference:
10a + b – (10b + a) = 9a – 9b = 9(a-b).
β–‘
9(a-b) is divisible by 9.”
! β€˜Without loss of generality’ (or w.l.o.g. for short)
means that we have assumed a specific case, but this
doesn’t make the proof any less β€˜general’.
Other Types of Proof
[Source: JMO] β€œX and Y play a game in which X
starts by choosing a number, which must be either
1 or 2.
Y then adds either 1 or 2 and states the total of the
two numbers chosen so far. X does likewise, adding
either 1 or 2 and stating the total, and so on. The
winner is first player to make the total reach (or
exceed) 20.
i) Explain how X can always win.
…
For (i), what do we actually have to show?
That for any way in which
? Y plays, we can always
find a resulting move that guarantees us to win.
Games
Other Types of Proof
Even/Odd
You will do this kind of proof next year...
β€œShow that for any integer n,
𝑛2 + 𝑛 is always even.”
All integers are either odd or even.
1. If n is odd: n2 is odd because odd x odd = odd. Then
odd + odd = even.
2. If n is even: n2 is even because even x even = even. Then
even + even = even.
?
What we’ve done here is split up all numbers according to
some property (i.e. odd or even). This made proving our
assertion for all integers easier.
Summary
So what makes a good (and valid!) proof?
1. Use of algebra:
a) When appropriate, use variables to represent something that could take any value
(e.g. the two digits!) This keeps your argument as general as possible.
b) Then use algebra to manipulate these variables based on the question.
2. Keep things general!
Avoid making assertions that would ignore certain possibilities.
3. Don’t make leaps of logic
Try not to β€˜assume’ too much. You need to clearly show your steps without making
assumptions, which may turn out to be wrong!
4. Avoid circular arguments
If the statement to prove is something like β€œIf X, then show that Y”, then your proof needs
to be something like: β€œAssume that X, then [manipulation involving X]... And thus Y is true.”
You can’t assume Y is true at any point, because that’s what you’re trying to prove!
5. Consider edge cases
Consider unusual cases. e.g. What if the first digit is 0? What if the digits are the
same? Does our proof still work?
6. Avoid listing out lots of cases
If you’re having to list out lots and lots of cases, then you’re possibly missing
ways to narrow down your search. Could you use algebra?