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.
107 exam-style questions on Edexcel A Level Maths 1.1 Proof by Contradiction. Each one has a worked solution and a mark scheme showing where the marks go.