The numbers of bricks in the rows, from the top, form an AP with a=2 and d=2.
(i)
2, 4, 6, 8, 10, …
First term a=2, common difference d=2.
(ii) Bricks in the 7th row
a7=2+(7−1)×2=2+12=14
Answer: 14 bricks.
(iii) Bricks in the first 10 rows
S10=210[2(2)+(10−1)(2)]=5[4+18]=5×22=110
Answer: 110 bricks.
(iv) Bricks in the bottom row of a 15-row wall
a15=2+(15−1)×2=2+28=30
Answer: 30 bricks.
(v) Complete rows with 150 bricks
The bricks needed for n complete rows are
Sn=2n[2(2)+(n−1)2]=2n(2n+2)=n(n+1)
We need the largest n with n(n+1)≤150:
n=11:11×12=132≤150 ✓
n=12:12×13=156>150 ×
So he can build 11 complete rows, using 132 bricks, and
150−132=18
bricks are left over — not enough for the 12th row, which needs a12=24 bricks.
Answer: 11 complete rows, with 18 bricks left over.