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.
368 exam-style questions on Edexcel A Level Maths Algebraic Methods, covering 1.1 Proof by Contradiction, 1.2 Algebraic Fractions, 1.3 Partial Fractions, 1.4 Repeated Factors, and 1.5 Algebraic Division. Each one has a worked solution and a mark scheme showing where the marks go.