Skip to content

Course home

1.1 Proof by Contradiction

1.1 Proof by Contradiction

EasyMediumHard
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
Question 80

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 Proof by Contradiction Questions

  1. A Level
  2. /Maths
  3. /1.1 Proof by Contradiction

107 exam-style questions on Edexcel A Level Maths 1.1 Proof by Contradiction. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank