A) The first step needs 100 bricks, the second needs 98, the third needs 96, and so on. Therefore the number of bricks for the nth step is: a_n = a_1 + d(n-1), where a_1 = 100 (the first term), d = -2 (difference).
a_n = 100 - 2(n-1) = 102 - 2n, and for the 30th step, a_30 = 102 - 2*30 = 42. So the top step will need 42 bricks.
b) The total staircase will need: 100 + 98 + 96 + ... + 44 + 42, and there are n = 30 terms. Using the formula for the sum of an arithmetic sequence:
S = (a_1 + a_n)*n/2 = (100 + 42)*30/2 = 2130
Therefore, 2130 bricks are required to build the entire staircase.
Answer:Solve. 2a + 3b = 5 6= a -5 a = 4 b = -1 1 a = 6 b=1 a=6 6 = -1 a=4 6 = 1
Step-by-step explanation:
Make all a and constant number in different side
10-7=16z-7z+2z
3=11z
z=3/11
