Skip to content

Course home

3.4 Sequences and Series (A-level only)

3.4 Sequences and Series (A-level only)

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179
Question 132
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

3.4 Sequences and Series (A-level only) Questions

  1. A Level
  2. /Maths
  3. /3.4 Sequences and Series (A-level only)

231 exam-style questions on WJEC A Level Maths 3.4 Sequences and Series (A-level only), covering 3.4.1 Sequences and Series (A-level only), 3.4.2 Sequences and Series (A-level only), 3.4.3 Sequences and Series (A-level only), 3.4.4 Sequences and Series (A-level only), 3.4.5 Sequences and Series (A-level only), 3.4.6 Sequences and Series (A-level only), and 3.4.7 Sequences and Series (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.

Question bank