Skip to content

Course home

1.1 Proof by Contradiction

1.1 Proof by Contradiction

EasyMediumHard
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
Question 69

In a cryptographic protocol, the number of decryption cycles, DDD, required for a security parameter s∈Ns \in \mathbb{N}s∈N is given by D=s2+4s+7D = s^2 + 4s + 7D=s2+4s+7.

Use algebra to prove by contradiction that if D D\,D is even, then s s\,s must be odd.

[4]
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