Skip to content
MathsGenie logo
Quick links
Open app

Course home

  1. A Level
  2. Maths OCR
  3. Question bank

1.1.4 Proof by contradiction (A-level only)

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
Question 61

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.

[4]

1.1.4 Proof by contradiction (A-level only) Questions

  1. A Level
  2. /Maths
  3. /1.1.4 Proof by contradiction (A-level only)