Skip to content

Course home

Sign up

1.1 Proof by Contradiction

EasyMedium
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
Question 42

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+2 p^2 = 4q + 2 p2=4q+2

so p2p^2p2 is even."

Complete the proof.

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