Using the formula nCr=n!r!(n−r)!{}^nC_r = \frac{n!}{r!(n-r)!}nCr=r!(n−r)!n!, prove that nC4=n(n−1)(n−2)(n−3)24{}^nC_4 = \frac{n(n-1)(n-2)(n-3)}{24}nC4=24n(n−1)(n−2)(n−3).
A cybersecurity firm is testing nnn distinct encryption keys. A 'Quad-Lock' configuration is formed by selecting a subset of 4 keys, while a 'Dual-Lock' configuration is formed by selecting a subset of 2 keys.
Given that the number of possible Quad-Lock configurations is exactly 11 times the number of possible Dual-Lock configurations, show that n2−5n−126=0n^2 - 5n - 126 = 0n2−5n−126=0.
Hence, determine the number of encryption keys nnn.
308 exam-style questions on OCR A Level Maths 1.4 Sequences and Series, covering 1.4.1 Binomial expansion for positive integer n, 1.4.2 Link to binomial probabilities, 1.4.3 Binomial expansion for rational n (A-level only), 1.4.4 Validity of the expansion (A-level only), 1.4.5 Sequences (A-level only), 1.4.6 Increasing, decreasing and periodic sequences (A-level only), 1.4.7 Sigma notation (A-level only), 1.4.8 Arithmetic sequences and series (A-level only), 1.4.9 Geometric sequences and series (A-level only), 1.4.10 Sum to infinity of a geometric series (A-level only), and 1.4.11 Modelling with sequences and series (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.