IP Year 4 Maths Advanced: methods of proof worksheet with answers
A free IP Year 4 Maths worksheet on Advanced: methods of proof: 13 questions, 50 marks, short and structured questions in the school exam style. The answers and full worked solutions are on the last page.
In the print window, choose Save as PDF to download it.
If the degree of accuracy is not specified in the question, and if the answer is not exact, give the answer to three significant figures. Give answers in degrees to one decimal place. For π, use either your calculator value or 3.142, unless the question requires the answer in terms of π.
1
A proof by contradiction shows that if n2 is a multiple of 3 then n is a multiple of 3. Which assumption does the proof start from?
[1]
2
A proof by contradiction shows that no odd number is a multiple of 4. Which assumption does the proof start from?
[1]
3
(a)A proof by contradiction shows that if n2 is even then n is even. Which assumption does the proof start from?
[1]
(b)Find the smallest positive integer n that is a counterexample to the statement "n2−n+5 is prime for every positive integer n".
(1)n=1
(2)n=3
(3)n=4
(4)n=5
Answer (b)[2]
(c)Prove that the sum of three consecutive even numbers is a multiple of 6. (The even numbers are 2n, 2n+2 and 2n+4.) Show that 2n+(2n+2)+(2n+4)=6(…), and write the bracket in terms of n.
Answer (c)[2]
4
(a)Prove that the sum of two consecutive odd numbers is a multiple of 4. (The odd numbers are 2n+1 and 2n+3.) Show that (2n+1)+(2n+3)=4(…), and write the bracket in terms of n.
Answer (a)[2]
(b)Find the smallest positive integer n that is a counterexample to the statement "n2+3n+13 is prime for every positive integer n".
(1)n=1
(2)n=5
(3)n=8
(4)n=9
Answer (b)[2]
5
(a)Find the smallest positive integer n that is a counterexample to the statement "n2−n+7 is prime for every positive integer n".
(1)n=1
(2)n=2
Answer (a)[2]
(b)Prove that (3n+1)2−(3n−1)2 is a multiple of 12. (Expand both squares.) Show that (3n+1)2−(3n−1)2=12(…), and write the bracket in terms of n.
Answer (b)[2]
6
(a)Prove that (2n+1)2+(2n−1)2 is 2 more than a multiple of 8. (Expand both squares; take away the 2.) Show that (2n+1)2+(2n−1)2−2=8(…), and write the bracket in terms of n.
Answer (a)[2]
(b)Find the smallest positive integer n that is a counterexample to the statement "n2+n+5 is prime for every positive integer n".
(1)n=1
(2)n=2
(3)n=3
(4)n=4
Answer (b)[2]
7
Prove by induction that r=1∑n(2r+3)=n(n+4) for all positive integers n. In the inductive step, find the term that is added to the sum of the first k terms, in terms of k.
Answer[3]
8
Prove by induction that 9n−1 is divisible by 8 for all positive integers n. In the inductive step, 9k+1−1=9(9k−1)+c. Find c.
Answer[3]
9
Prove by induction that 12n−5n is divisible by 7 for all positive integers n. In the inductive step, 12k+1−5k+1=12(12k−5k)+c×5k. Find c.
Answer[3]
10
Prove by induction that 12n−5n is divisible by 7 for all positive integers n. In the inductive step, 12k+1−5k+1=12(12k−5k)+c×5k. Find c.
Answer[3]
11
(a)A proof by contradiction shows that 3 is irrational. Which assumption does the proof start from?
[1]
(b)Find the smallest positive integer n that is a counterexample to the statement "3n2−n+5 is prime for every positive integer n".
(1)n=1
(2)n=2
Answer (b)[2]
(c)Prove that the product of three consecutive integers plus the middle one is a cube. (The integers are n−1, n and n+1.) Show that (n−1)n(n+1)+n=(…), and write the bracket in terms of n.
Answer (c)[2]
12
(a)A proof by contradiction shows that no integer is both even and odd. Which assumption does the proof start from?
[1]
(b)Prove that the sum of three consecutive even numbers is a multiple of 6. (The even numbers are 2n, 2n+2 and 2n+4.) Show that 2n+(2n+2)+(2n+4)=6(…), and write the bracket in terms of n.
Answer (b)[2]
(c)Prove by induction that 5n−2n is divisible by 3 for all positive integers n. In the inductive step, 5k+1−2k+1=5(5k−2k)+c×2k. Find c.
Answer (c)[3]
13
(a)A proof by contradiction shows that 6 is irrational. Which assumption does the proof start from?
[1]
(b)Find the smallest positive integer n that is a counterexample to the statement "2n2+3 is prime for every positive integer n".
(1)n=1
(2)n=2
(3)n=3
Answer (b)[2]
(c)Prove that the mean of three consecutive integers is the middle one. (Three times the mean is the sum.) Show that 3n+(n+1)+(n+2)×3=3(…), and write the bracket in terms of m and n.
Answer (c)[2]
(d)Prove by induction that r=1∑nr⋅2r=(n−1)2n+1+2 for all positive integers n. In the inductive step, find the term that is added to the sum of the first k terms, in terms of k.
Answer (d)[3]
END OF PAPER
Answers and worked solutions
Question 1
Answer: R[1]
To prove: if n2 is a multiple of 3 then n is a multiple of 3.The oppositeAssume n2 is a multiple of 3 and n is not.A contradiction: so the assumption is false, and the statement is true.
Question 2
Answer: R[1]
To prove: no odd number is a multiple of 4.The oppositeAssume some odd number is a multiple of 4.A contradiction: so the assumption is false, and the statement is true.
Question 3
(a)Answer: R[1]
To prove: if n2 is even then n is even.The oppositeAssume n2 is even and n is odd.A contradiction: so the assumption is false, and the statement is true.
(b)Answer: 5[2]
n=1: 5 is prime… up to n=4: 17 is prime(5)2−(5)+5=2525=5×5, not primen=5
(c)Answer: So the sum of three consecutive even numbers is a multiple of 6.[2]
2n+(2n+2)+(2n+4)=6n+6=6(n+1)So the sum of three consecutive even numbers is a multiple of 6.
Question 4
(a)Answer: So the sum of two consecutive odd numbers is a multiple of 4.[2]
(2n+1)+(2n+3)=4n+4=4(n+1)So the sum of two consecutive odd numbers is a multiple of 4.
(b)Answer: 9[2]
n=1: 17 is prime… up to n=8: 101 is prime(9)2+3(9)+13=121121=11×11, not primen=9
Question 5
(a)Answer: 2[2]
n=1: 7 is prime(2)2−(2)+7=99=3×3, not primen=2
(b)Answer: So (3n+1)2−(3n−1)2 is a multiple of 12.[2]
(3n+1)2−(3n−1)2=12nSo (3n+1)2−(3n−1)2 is a multiple of 12.
Question 6
(a)Answer: So (2n+1)2+(2n−1)2 is 2 more than a multiple of 8.[2]
(2n+1)2+(2n−1)2−2=8n2=8(n2)So (2n+1)2+(2n−1)2 is 2 more than a multiple of 8.
(b)Answer: 4[2]
n=1: 7 is prime… up to n=3: 17 is prime(4)2+(4)+5=2525=5×5, not primen=4
Question 7
Answer: True for n=1, and true for k implies true for k+1: true for every positive integer n.[3]
LHS =5, RHS =1×5: true for n=1r=1∑k(2r+3)=k(k+4)r=1∑k+1(2r+3)=k(k+4)+uk+1uk+1=2(k+1)+3=(k+1)(k+5), so true for n=k+1True for n=1, and true for k implies true for k+1: true for every positive integer n.
Question 8
Answer: =9×8M+8, divisible by 8: true for n=k+1, so for every positive integer n[3]
9−1=8, divisible by 89k−1=8M for an integer M9k+1−1=9(9k−1)+9×1−1=9(9k−1)+(9−1)c=8=9×8M+8, divisible by 8: true for n=k+1, so for every positive integer n
Question 9
Answer: =12×7M+7×5k, divisible by 7: true for n=k+1, so for every positive integer n[3]
12−5=7, divisible by 712k−5k=7M for an integer M12k+1−5k+1=12(12k−5k)+12×5k−5×5k=12(12k−5k)+(12−5)×5kc=7=12×7M+7×5k, divisible by 7: true for n=k+1, so for every positive integer n
Question 10
Answer: =12×7M+7×5k, divisible by 7: true for n=k+1, so for every positive integer n[3]
12−5=7, divisible by 712k−5k=7M for an integer M12k+1−5k+1=12(12k−5k)+12×5k−5×5k=12(12k−5k)+(12−5)×5kc=7=12×7M+7×5k, divisible by 7: true for n=k+1, so for every positive integer n
Question 11
(a)Answer: R[1]
To prove: 3 is irrational.The oppositeAssume 3=qp, with p and q integers with no common factor.A contradiction: so the assumption is false, and the statement is true.
(b)Answer: 2[2]
n=1: 7 is prime3(2)2−(2)+5=1515=3×5, not primen=2
(c)Answer: =(n3)[2]
(n−1)n(n+1)+n=n3=(n3)So the product of three consecutive integers plus the middle one is a cube.
Question 12
(a)Answer: R[1]
To prove: no integer is both even and odd.The oppositeAssume some integer n is both even and odd.A contradiction: so the assumption is false, and the statement is true.
(b)Answer: So the sum of three consecutive even numbers is a multiple of 6.[2]
2n+(2n+2)+(2n+4)=6n+6=6(n+1)So the sum of three consecutive even numbers is a multiple of 6.
(c)Answer: =5×3M+3×2k, divisible by 3: true for n=k+1, so for every positive integer n[3]
5−2=3, divisible by 35k−2k=3M for an integer M5k+1−2k+1=5(5k−2k)+5×2k−2×2k=5(5k−2k)+(5−2)×2kc=3=5×3M+3×2k, divisible by 3: true for n=k+1, so for every positive integer n
Question 13
(a)Answer: R[1]
To prove: 6 is irrational.The oppositeAssume 6=qp, with p and q integers with no common factor.A contradiction: so the assumption is false, and the statement is true.
(b)Answer: 3[2]
n=1: 5 is prime… up to n=2: 11 is prime2(3)2+3=2121=3×7, not primen=3
(c)Answer: =3(n+1)[2]
3n+(n+1)+(n+2)×3=3n+3=3(n+1)So the mean of three consecutive integers is the middle one.
(d)Answer: True for n=1, and true for k implies true for k+1: true for every positive integer n.[3]
LHS =2, RHS =0×4+2: true for n=1r=1∑kr⋅2r=(k−1)2k+1+2r=1∑k+1r⋅2r=(k−1)2k+1+2+uk+1uk+1=(k+1)⋅2(k+1)=k⋅2k+2+2, so true for n=k+1True for n=1, and true for k implies true for k+1: true for every positive integer n.