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.
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.