Skip to content

Course home

Sign up

1.7.1 Binomial expansion

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
Question 67
a.

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)​.

[2]
bi.

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.

[3]
bii.

Hence, determine the number of encryption keys nnn.

[2]
Markscheme

1.7.1 Binomial expansion Questions

  1. A Level
  2. /Maths
  3. /1.7.1 Binomial expansion

144 exam-style questions on AQA A Level Maths 1.7.1 Binomial expansion. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank