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:
3280
Step-by-step explanation:
52×63=3276
Round 3276 to 3280
Hope this helps! :)
Answer:
Step-by-step explanation:
answer to the question:
download it here! bit.lif.123214
im kidding. im not one of the virus givers xdd. but they do need to be stopped
Answer:<2 and <3 are the two angles that are exterior angles!
Step-by-step explanation:
Hope this helped!
<!> Brainliest is appreciated! <!>
Answer: 3t-8
Step-by-step explanation:
<em>3t-8 is the answer because there are no like terms.</em>
<em />
