Skip to content
MathsGenie logo
Quick links
Open app

Course home

  1. A Level
  2. Maths OCR (MEI)
  3. Question bank

1.1.3 Proof by contradiction (A-level only)

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
Question 63

An engineer investigating mechanical stress determines that a critical component fails only when the stress factor S=n2+7n+5S = n^2 + 7n + 5S=n2+7n+5 is a multiple of 3, where nnn is an integer. The engineer wishes to prove that the component will never fail.

A proof by contradiction is initiated as follows:

'Assume there exists an integer nnn such that n2+7n+5n^2 + 7n + 5n2+7n+5 is divisible by 3.'

Case 1: n=3kn = 3kn=3k for some integer kkk.

S=(3k)2+7(3k)+5=9k2+21k+5=3(3k2+7k+1)+2 S = (3k)^2 + 7(3k) + 5 = 9k^2 + 21k + 5 = 3(3k^2 + 7k + 1) + 2 S=(3k)2+7(3k)+5=9k2+21k+5=3(3k2+7k+1)+2

As this expression leaves a remainder of 2 when divided by 3, it is not divisible by 3, which contradicts the initial assumption for this case.

Complete the proof.

[5]

1.1.3 Proof by contradiction (A-level only) Questions

  1. A Level
  2. /Maths
  3. /1.1.3 Proof by contradiction (A-level only)