Skip to content
MathsGenie logo
Open app

Course home

  1. A Level
  2. Maths AQA
  3. Question bank

1.4 A: Proof

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]

1.4 A: Proof Questions

  1. A Level
  2. /Maths
  3. /1.4 A: Proof

Practise AQA A Level Maths 1.4 A: Proof with exam-style questions for A Level Maths. 107 questions covering 1.4.1 Structure and methods of proof, matched to the AQA A Level Maths (7357) specification and written in Paper 1, Paper 2 and Paper 3 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.

Question bank