Skip to content

Course home

1.1 Proof

1.1 Proof

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
Question 72

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 Questions

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

132 exam-style questions on OCR (MEI) A Level Maths 1.1 Proof, covering 1.1.1 Structure of mathematical proof, 1.1.2 Disproof by counter example, 1.1.3 Proof by contradiction (A-level only), and 1.1 Proof. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank