Skip to content

Course home

1.1.4 Proof by contradiction (A-level only)

1.1.4 Proof by contradiction (A-level only)

EasyMedium
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
Question 68

An information theorist studying data compression models determines that the efficiency factor of a specific algorithm is given by ϵ=log⁡27\epsilon = \log_2 7ϵ=log2​7. A developer claims that this factor is a rational number and can be expressed exactly as a ratio of two integers pq\displaystyle \frac{p}{q}qp​. Use the method of proof by contradiction to show that the developer's claim is incorrect.

[5]
Markscheme

1.1.4 Proof by contradiction (A-level only) Questions

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

107 exam-style questions on OCR A Level Maths 1.1.4 Proof by contradiction (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.

Question bank