Skip to content

Course home

Sign up

1.1 Proof by Contradiction

EasyMedium
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
Question 59

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