Skip to content

Course home

1.4 Sequences and Series

1.4 Sequences and Series

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245
Question 171

A robotic arm moves along a linear track. Its position pnp_npn​ (in cm) at step n n\,n is governed by the recurrence relation:

pn+1=3−(pn)2 p_{n+1} = 3 - (p_n)^2 pn+1​=3−(pn​)2
a.

In the case where the arm starts at p1=2p_1 = 2p1​=2:

(i) Find the value of p3p_3p3​.

(ii) Determine the value of p100p_{100}p100​.

[4]
b.

State a different value for p1p_1p1​, other than p1=2p_1 = 2p1​=2, which gives the same value for p100p_{100}p100​ as found in part (a)(ii).

[2]
Markscheme

1.4 Sequences and Series Questions

  1. A Level
  2. /Maths
  3. /1.4 Sequences and Series

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.

Question bank