Skip to content

Course home

Sign up

1.1 Proof by Contradiction

EasyMedium
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
Question 82

A security researcher is investigating a cryptographic protocol where valid key pairs (n,m)(n, m)(n,m) must satisfy the property that nnn and mmm are integers such that:

n2−20m−14=0 n^2 - 20m - 14 = 0 n2−20m−14=0
a.

Prove that nnn is even.

[2]
b.

Hence, prove that 10m+710m + 710m+7 is even and explain why this leads to a contradiction.

[3]
c.

Explain what can be deduced about the existence of valid key pairs (n,m)(n, m)(n,m) for this protocol.

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