SOLUTION: A brick wall is built with bottom row having 50 bricks. Each row on top of that is one less. The next is 49, then 48 and so on continuing on until the top row is just 1 brick. A
Algebra ->
Sequences-and-series
-> SOLUTION: A brick wall is built with bottom row having 50 bricks. Each row on top of that is one less. The next is 49, then 48 and so on continuing on until the top row is just 1 brick. A
Log On
Question 891685: A brick wall is built with bottom row having 50 bricks. Each row on top of that is one less. The next is 49, then 48 and so on continuing on until the top row is just 1 brick. A) How can I write the total # of bricks as a summation?
Here's what I know. I know the answer is 1275 bricks. I know d=1. I tried sn=((n)(2a(sub1) + (n-1) d)) / 2. I tried solving with 50 plugged in for n and 1 in for 2a(sub1), and vice versa. I am 25 away from the correct answer. Just not sure of the placement of my numbers.
Thank you for any help you can give. Answer by Fombitz(32388) (Show Source):
