Skip to content

Course home

1.1 Proof by Contradiction

1.1 Proof by Contradiction

EasyMediumHard
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
Question 92

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