Pearson Edexcel AS Level · Mathematics (8MA0)

Proof: Practice Questions

5 multiple-choice questions marked as you go, and 5 written questions with worked solutions. All on Proof.

10 questions21 marksFree, no account
Question 1
1 mark

A student attempts to prove that for all integers \(n\), the expression \(n^2 - n + 41\) is a prime number. Which value of \(n\) provides a counter-example to this statement?

Question 2
1 mark

Identify the error in the following deductive proof that \(2 = 1\):
1. Let \(a = b\)
2. \(a^2 = ab\)
3. \(a^2 - b^2 = ab - b^2\)
4. \((a - b)(a + b) = b(a - b)\)
5. \(a + b = b\)
6. \(2b = b\)
7. \(2 = 1\)

Question 3
1 mark

A student is using proof by exhaustion to show that \(n^2 + 2\) is not divisible by 4 for any integer \(n\) such that \(1 \le n \le 3\). Which set of calculations completes this proof?

Question 4
1 mark

To disprove the statement "\(2^n - 1\) is a prime number for all odd integers \(n > 1\)", which value of \(n\) should be used as a counter-example?

Question 5
1 mark

A student is asked to prove that for all real values of \(x\), \(x^2 - 4x + 7 > 0\).
Which of the following algebraic steps is the most appropriate starting point for a proof by deduction?

Question 6
2 marks

Show by counter-example that the statement \( |x + y| = |x| + |y| \) is not true for all real numbers \( x \) and \( y \).

Write your answer out first, then check it against the worked solution.

Question 7
4 marks

Use the method of deduction to prove that for all real values of \( x \), the quadratic expression \( x^2 - 4x + 7 \) is always positive.

Write your answer out first, then check it against the worked solution.

Question 8
2 marks

A student claims that \( n^2 + n + 11 \) is a prime number for all positive integers \( n \). Provide a counter-example to disprove this statement.

Write your answer out first, then check it against the worked solution.

Question 9
3 marks

Prove by deduction that the product of two odd numbers is always odd.

Write your answer out first, then check it against the worked solution.

Question 10
5 marks

(a) Use the method of exhaustion to show that \( n^2 - n + 11 \) is a prime number for all integers \( n \) where \( 1 \le n \le 3 \).
(b) Show that the statement "\( n^2 - n + 11 \) is prime for all positive integers \( n \)" is false by finding a counter-example.

Write your answer out first, then check it against the worked solution.

* The content provided by thinka is generated by AI and may not always be accurate or up-to-date. Please use it as a supplementary resource and verify with official materials.

You've seen the model answer. Now get yours marked.

This page can show you how a good answer looks. It cannot tell you what your answer was missing. thinka marks your written work against the real mark scheme in about 15 seconds.

Want more questions like these? Get a fresh set on this topic, marked as you go.

Practise More