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 (MEI) A Level Maths 1.6 Sequences and Series, covering 1.6.1 Binomial expansion for positive integer n, 1.6.2 Factorial and combinations notation, 1.6.3 Binomial expansion for rational n (A-level only), 1.6.4 Binomial expansion of (a + bx)^n via factoring (A-level only), 1.6.5 Binomial approximating polynomials (A-level only), 1.6.6 What a sequence is; finite and infinite (A-level only), 1.6.7 Generate a sequence by formula or recurrence (A-level only), 1.6.8 A series as a sum of terms (A-level only), 1.6.9 Sigma notation (A-level only), 1.6.10 Increasing, decreasing and periodic sequences (A-level only), 1.6.11 Convergent and divergent sequences (A-level only), 1.6.12 Arithmetic sequences and series (A-level only), 1.6.13 Standard formulae for arithmetic series (A-level only), 1.6.14 Geometric sequences and series (A-level only), 1.6.15 Standard formulae for geometric series (A-level only), 1.6.16 Sum to infinity of a geometric series (A-level only), and 1.6.17 Sequences and series in modelling (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.