A cryptographic system generates security keys using integers of the form K=6n−1K = 6n - 1K=6n−1, where n∈Z+n \in \mathbb{Z}^{+}n∈Z+. A researcher claims that there is a maximum possible key value that can be generated by this rule. Prove by contradiction that there is no greatest integer of the form 6n−16n - 16n−1.
Practise AQA A Level Maths 1.4 A: Proof with exam-style questions for A Level Maths. 107 questions covering 1.4.1 Structure and methods of proof, matched to the AQA A Level Maths (7357) 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.
