Skip to content

Course home

Sign up

3.1.1 Proof (A-level only)

EasyMedium
12345678910111213141516171819202122232425
Question 20

A cybersecurity algorithm generates security keys using integers of the form n=6k−1n = 6k - 1n=6k−1, where k∈Zk \in \mathbb{Z}k∈Z.

Prove by contradiction that there is no greatest integer of this form.

[3]
Markscheme

3.1.1 Proof (A-level only) Questions

  1. A Level
  2. /Maths
  3. /3.1.1 Proof (A-level only)

107 exam-style questions on WJEC A Level Maths 3.1.1 Proof (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.

Question bank