- 1
A sequence has rth term ur=2r+3, and Sn is the sum of the first n terms. (a)Find an expression for Sn. [1 mark] - An2+n+3
- B2n(n+1)+3n
- Cn(n+4)
- D2n(n+1)+3n
Show the mark scheme
(b)Find the value of S20. [1 mark] - A480
- B423
- C270
- D440
Show the mark scheme
(c)Find the smallest value of n for which Sn>1000. [2 marks] Show the mark scheme
Mark scheme
M1: solves or tests n(n+4)>1000, e.g. S29=957 and S30=1020
A1: n=30 Total for question 1: 4 marks
- 2
Let Sn=1×3+2×4+3×5+⋯+n(n+2), the sum of the first n terms of a series. (a)Find a simplified expression for Sn. [1 mark] - A3n(n+1)(n+2)
- B6n(n+1)(2n+7)
- C6n(n+1)(2n+1)+2
- D6n2(n+1)2(2n+1)
Show the mark scheme
(b)Find the value of S10. [1 mark] - A385
- B440
- C110
- D495
Show the mark scheme
(c)Find the sum of the 6th to the 10th terms of the series, inclusive.
[2 marks] Show the mark scheme
Mark scheme
M1: S10−S5 with S5=65×6×17=85
A1: 495−85=410 Total for question 2: 4 marks
- 3
An orange display is built in layers. Layer r, counting from the top with r=1,2,3,…, is a square arrangement containing r2 oranges. (a)Find the number of oranges in layers 13 to 20 inclusive. [3 marks] Show the mark scheme
Mark scheme
M1: ∑r=120r2−∑r=112r2
A1: 2870 and 650
A1: 2220 (b)A second display has r(r+3) oranges in layer r. Show that the total number of oranges in n layers of the second display is 3n(n+1)(n+5). [4 marks] Show the mark scheme
Mark scheme
M1: ∑r2+3∑r
M1: 6n(n+1)(2n+1)+23n(n+1)
M1: takes out the factor 6n(n+1), giving 6n(n+1)[(2n+1)+9]
A1: 6n(n+1)(2n+10)=3n(n+1)(n+5) (AG) Total for question 3: 7 marks
- 4
A sequence has rth term ur=r(2r+3), and Sn=∑r=1nur. (a)(i) Show that Sn=6n(n+1)(4n+11).
(ii) Hence find the sum of the 11th to the 20th terms of the sequence. [6 marks] Show the mark scheme
Mark scheme
M1: (i) ∑(2r2+3r)=2∑r2+3∑r
M1: (i) 2⋅6n(n+1)(2n+1)+3⋅2n(n+1)
M1: (i) takes out 6n(n+1), giving [2(2n+1)+9]
A1: (i) 6n(n+1)(4n+11) (AG)
M1: (ii) S20−S10 with S20=6370 and S10=935
A1: (ii) 5435 (b)Given that Sn=1210, show that 4n3+15n2+11n−7260=0 and hence find the value of n, justifying that there is only one possible value. [6 marks] Show the mark scheme
Mark scheme
M1: 6n(n+1)(4n+11)=1210
A1: n(4n2+15n+11)=7260, giving 4n3+15n2+11n−7260=0 (AG)
B1: n=11 is a root, e.g. 4(1331)+15(121)+121−7260=0
M1: divides or factorises by (n−11)
A1: (n−11)(4n2+59n+660)=0
R1: the quadratic has discriminant 592−4(4)(660)<0, so n=11 only Total for question 4: 12 marks
End of questions