1.1 Proof by Contradiction
61
0/5

A cybersecurity researcher is analyzing a specific encryption key property. They need to prove that the equation p2−4q=2p^2 - 4q = 2p2−4q=2 has no integer solutions for ppp and qqq.

The researcher starts a proof by contradiction as shown below:

"Suppose there exist integers ppp and qqq such that p2−4q=2p^2 - 4q = 2p2−4q=2. This implies that p2=4q+2p^2 = 4q + 2p2=4q+2 so p2p^2p2 is even."

Complete the proof.

[5]

1.1 Proof by Contradiction Questions

Practise Edexcel A Level Maths 1.1 Proof by Contradiction with exam-style questions for A Level Maths. 100 questions, matched to the Edexcel A Level Maths (9MA0) 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.

PreviousNext

1.1 Proof by Contradiction Questions

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