Visit http://www.mathsmadeeasy.co.uk/ for more fantastic resources.

AQA, Edexcel, OCR

A Level

A Level Mathematics
Proof by Contradiction
(Answers)

Name:

Total Marks:

Maths Made Easy © Complete Tuition Ltd 2017

 A1 – Proof Answers
AQA, Edexcel, OCR

1) Prove that there is an infinite amount of prime numbers.

Proof by contradiction.
[1 mark]
Assume there are a finite number of prime numbers, that we write as: (1)
𝑝1 , 𝑝2 , 𝑝3 , … , 𝑝𝑛
[1 mark]
And we define a new number as
𝑚 = 𝑝1 × 𝑝2 × 𝑝3 × … × 𝑝𝑛 + 1
[1 mark]
As we are saying that there are no other prime numbers than the list defined in (1), then m
should not be a prime number and therefore divisible by 𝑝𝑛 .
[1 mark]
However, if we do this we are left with a remainder, 1, and as there are no integers that
divide 1, then m must also be a prime number. This is the contradiction. Hence there are
infinitely many prime numbers.

2) For all real numbers if 𝐱 𝟑 is rational, then 𝐱 is also rational. True or false?
[1 mark]
This is a true statement.
[1 mark]
Let x be a rational number, defined as
𝑝
𝑥=
𝑞
an irreducible fraction, where 𝑝, 𝑞 ∈ ℤ.
[1 mark]
Cubing both sides of equation gives
𝑝3
𝑥3 =
𝑞3
[1 mark]
We note that are integers because p and q are integers then so are their cubes. This means
that 𝑥 3 is defined as the ratio of two integers, thus making it rational.
3)
y
10
9
8
7
6
5
4
3
2
1
0 x
-5 -4 -3 -2 -1 0 1 2 3 4 5

𝟓
The graph is defined as 𝒌𝒙𝟐 + 𝟔𝒌𝒙 + 𝟓 = 𝟎 where k is constant. Prove that 𝟎 ≤ 𝒌 ≤ 𝟗.

[1 mark]
Here you must spot that the graph does not intersect the x-axis and thus there are no real
root solutions to this problem.
The graph clearly shows that the constant k is7 not negative.
[1 mark]
Insert 𝑘 = 0, and show 0 + 0 + 5 = 0 is not a viable solution.
[1 mark]
Note, using the quadratic equation discriminant that for non-real roots, 𝑏 2 < 4𝑎𝑐.
Inserting values of 𝑎 = 𝑘, 𝑏 = 6𝑘, 𝑐 = 5, gives
36𝑘 2 < 20𝑘
4𝑘(9𝑘 − 5) < 0
5
0<𝑘<
9
[1 mark]
However, we know 𝑘 = 0, is a solution so we can modify it to:
5
0≤𝑘<
9
4) Prove that √𝟐 is irrational.
Proof by contradiction.
[1 mark]
Assume that is rational and can be defined as
𝑎
√2 =
𝑏
an irreducible fraction, where 𝑎, 𝑏 ∈ ℤ.
[1 mark]
Squaring both sides gives
𝑎2
2=
𝑏2
2𝑏2 = 𝑎2
[1 mark]
The LHS is an even number, this means that the RHS must also be an even number. Thus,
both a and b are even.
[1 mark]
𝑎
Contradiction. We originally stated that 𝑏 was irreducible, however if the integers were

both even it would be reducible, by dividing by 2.

5) If 𝐚, 𝐛 ∈ ℤ, then 𝐚𝟐 − 𝟒𝐛 − 𝟑 ≠ 𝟎.
Proof by contradiction.
[1 mark]
Assume the quadratic does equal zero. (1)
𝑎2 − 4𝑏 − 3 = 0
⇒ 𝑎2 = 4𝑏 + 3 (2)
[1 mark]
The RHS here is odd, therefore, the LHS 𝑎2 and ultimately 𝑎 is odd. We can define 𝑎 as
𝑎 = 2𝑛 + 1
[1 mark]
Substituting (2) back into (1) gives
(2𝑛 + 1)2 = 4𝑏 + 3
4𝑛2 + 4𝑛 + 1 = 4𝑏 + 3
4 (𝑛 2 + 𝑛 − 𝑏 ) = 2
2
(𝑛 2 + 𝑛 − 𝑏 ) =
4
[1 mark]
Contradiction, on the LHS we have integers and on the RHS we have a fraction. Therefore,
the assumption that the quadratic equals zero is incorrect.

6) Using proof by contradiction show that there are no positive integer solutions to the
Diophantine equation 𝒙𝟐 − 𝒚𝟐 = 𝟏𝟎.
[1 mark]
Assume positive integer solutions.
[1 mark]
Spot solution is difference of two squares. (1)
(𝑥 + 𝑦)(𝑥 − 𝑦) = 1 (2)
𝑥 + 𝑦 = 1, 𝑥 − 𝑦 = 1
𝑥 + 𝑦 = −1, 𝑥 − 𝑦 = −1
Solving (1), by adding, gives:
𝑥 = 2, 𝑦 = 0
[1 mark]
This is a contradiction as x and y should be positive.
Solving (2), by adding, gives:
𝑥 = −1, 𝑦 = 0
[1 mark]
Again, this is a contradiction as x and y should be positive.
7) If a is a rational number and b is an irrational number, then a + b is an irrational number.

Demonstrate, using proof, why the above statement is correct.

Proof by contradiction.
[1 mark]

Assume, a is a rational number, b is an irrational number a + b is a rational number.

Therefore, a can be represented as the ratio of two integers,
𝑚
𝑛
b can be left the same and a + b can also be represented as the ratio of two integers,
𝑗
𝑘
[1 mark]
Writing our assumptions out gives
𝑚 𝑗
+𝑏 =
𝑛 𝑘
𝑗 𝑚
⇒𝑏= −
𝑘 𝑛
𝑘𝑚 − 𝑛𝑗
⇒𝑏=
𝑘𝑛
[1 mark]
Contraction. This last statement says b equals the product of two integers (km) minus the
product of two other integers (nj), all divided by another integer product (kn). This means
b is rational. However, we know b is irrational so the assumption that rational + irrational
= rational is incorrect.

8) Prove that triangle ABC can have no more than one right angle.
Proof by contradiction.
∠𝐴 + ∠𝐵 + ∠𝐶 = 180𝑜
[1 mark]
If
∠𝐴 = 900 𝑎𝑛𝑑 ∠𝐵 = 90𝑜
then
90𝑜 + 90𝑜 + ∠𝐶 = 180𝑜
∠𝐶 = 0𝑜
[1 mark]
Contradiction. Triangles must have three angles, one cannot equal 0.
9) Prove that the product of sum of three consecutive integers is divisible by 3.
Let the first integer be n, the second n+1 and the third n+2.
[1 mark]
Their sum, therefore, is
𝑛 + (𝑛 + 1) + (𝑛 + 2)
3𝑛 + 3
3(𝑛 + 1)
[1 mark]
And three is divisible by three.

10) The number of even integers is limitless. Prove or disprove this statement.
Proof by contradiction.
[1 mark]
Assume the number of even integers is limited and this largest number is called 𝐿.
𝐿 = 2𝑛
as it is even.
[1 mark]
Consider, L+2
𝐿 + 2 = 2𝑛 + 2
𝐿 + 2 = 2(𝑛 + 1)
which is also even and larger than L.
[1 mark]
This is a contradiction to our original assumption.

11) Suppose 𝐚 ∈ ℤ If 𝒂𝟐 is even, then 𝒂 is even.

Proof by contradiction.
[1 mark]
Suppose 𝑎2 is not even, then we can define it as
𝑎2 = (2𝑛 + 1)2
𝑎2 = 4𝑛2 + 4𝑛 + 1
𝑎2 = 2(2𝑛2 + 2) + 1
which is an odd number.
[1 mark]
This means 𝑎2 is an odd number, if 𝑎 is an even number, this makes 𝑎2 an even number too.
How can 𝑎2 be both even and odd. It cannot.
 𝟏
12) Prove that 𝒅
(𝟑𝟐 𝒙 + 𝝅) is irrational.
𝒅𝒙

[1 mark]
1
Correctly differentiate the statement to give 32 , which is the same as √3.
𝑚
Assume √3 is rational and can be represented as 𝑛 , an irreducible fraction.

[1 mark]
𝑚 (1)
√3 =
𝑛
𝑚2 (2)
⇒3=
𝑛2
⇒ 3𝑛2 = 𝑚2 (3)
Assuming n is even, thus making m even, would mean that the original irreducible fraction
𝑚
could have been reduced. Assuming n is odd, this makes m also odd, allows us to
𝑛

continue with the proof.

[1 mark]
We can write
𝑛 = 2𝑗 + 1 (4)

𝑚 = 2𝑘 + 1 (5)

[1 mark]
Substituting (4) and (5) back into (3) gives
3(2𝑗 + 1)2 = (2𝑘 + 1)2
3(4𝑗 2 + 4𝑗 + 1) = 4𝑘 2 + 4𝑘 + 1
12𝑗 2 + 12𝑗 + 2 = 4(𝑘 2 + 𝑘)
6𝑗 2 + 6𝑗 + 1 = 2(𝑘 2 + 𝑘) (6)
[1 mark]
Contradiction. On the left-hand side of (6) we have an odd integer (as we have two terms
containing 6 plus 1) and on the right-hand side we have an even integer.
This means that our original assumption that √3 is rational is incorrect.