Methods of Proof · Guided Practice
Methods of Proof
20 questions with answers and video solutions. Try each one before revealing the answer.
No hints on this one — its full written solution is with the answer.
Answer
Let represent the product of the first prime numbers. Then is prime
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
No hints on this one — its full written solution is with the answer.
Answer
Prove by induction that,
No hints on this one — its full written solution is with the answer.
Answer
Prove by induction that ,
Answer
Assume true for :
Then
True for , and true for implies true for , so by induction the statement holds
Prove by induction that
for all positive integers
Answer
Assume true for :
Then
True for , and true for implies true for , so by induction the statement holds for all positive integers
(a)Consider the statement:
For all integers and , if then
Find a counterexample to show that the statement is false.
(b)Let be an odd integer.
Prove directly that is divisible by 4.
Answer
(b) Let for Then , which is divisible by 4.
Consider the statement: For all odd numbers , is prime.
(a)Find a counterexample to show that the statement is false.
(b)Prove directly that the difference between the cubes of any two consecutive integers is not divisible by 3.
Answer
(b) Let the consecutive integers be and Then , which leaves a remainder of 1 when divided by 3, so it is not divisible by 3.
Prove by induction that, for all positive integers ,
Answer
Assume true for :
Then
True for , and true for implies true for , so by induction the statement holds for all positive integers
Consider statements A and B below.
For each statement: if true, provide a proof; if false, provide a counterexample.
A: The sum of the squares of any two consecutive integers is always prime.
B: The sum of the squares of any two consecutive integers is always odd.
Answer
Statement B is true: Proof, let the integers be and Then , which is odd.
Prove by induction that, for all positive integers ,
Answer
Assume true for :
Then
True for , and true for implies true for , so by induction the statement holds for all positive integers
Prove by induction that is divisible by 3 for all
Answer
Assume true for , so for some integer , giving
Then , a multiple of 3.
True for , and true for implies true for , so by induction the statement holds for all
Let be a positive real number and consider the following statement:
If is irrational then is irrational.
(a)Write down the contrapositive of the statement.
(b)Hence prove that the statement is true.
Answer
(b) Assume is rational, so for integers and with
Squaring gives , a ratio of two integers with , so is rational.
The contrapositive is true, so the original statement is true.
Keep practising
More methods of proof questions
New questions, modelled on past paper questions and checked against their marking instructions. Not reprints — you have not seen these before.
Practice questions courtesy of Maths.scot. Full written solutions are on his site — the links above go straight to them.