1.4.1 Structure and methods of proof

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

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

[3]

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

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

[3]

1.4.1 Structure and methods of proof Questions