Active forum topics
- Hydraulics: Rotating Vessel
- Inverse Trigo
- General Solution of $y' = x \, \ln x$
- engineering economics: construct the cash flow diagram
- Eliminate the Arbitrary Constants
- Law of cosines
- Maxima and minima (trapezoidal gutter)
- Special products and factoring
- Integration of 4x^2/csc^3x√sinxcosx dx
- application of minima and maxima
New forum topics
- Hydraulics: Rotating Vessel
- Inverse Trigo
- General Solution of $y' = x \, \ln x$
- engineering economics: construct the cash flow diagram
- Integration of 4x^2/csc^3x√sinxcosx dx
- Maxima and minima (trapezoidal gutter)
- Special products and factoring
- Newton's Law of Cooling
- Law of cosines
- Can you help me po to solve this?
Recent comments
- Determine the least depth…1 month 4 weeks ago
- Solve mo ang h manually…2 months 1 week ago
- Paano kinuha yung height na…2 months 1 week ago
- It's the unit conversion…2 months 3 weeks ago
- Refer to the figure below…2 months 2 weeks ago
- Yes.6 months 1 week ago
- Sir what if we want to find…6 months 1 week ago
- Hello po! Question lang po…6 months 4 weeks ago
- 400000=120[14π(D2−10000)]
(…8 months ago - Use integration by parts for…8 months 4 weeks ago
Re: Algebra
The topmost layer in the pile contains 1 pole, the 2nd layer 2 poles, the third layers 3 poles, and so on. The bottom-most layer, say nth layer, contains n posts.
$1 + 2 + 3 ~ + ... + ~ 5 ~ + ... + ~ n$
The number of poles in these layers of piles is in the form of arithmetic progression (AP) with a common difference d of 1. The first term a1 in AP is 1 (for topmost layer) and the number of terms in AP is the number of layers in the pile. The formula is given by
$S = \frac{1}{2}n[ \, 2a_1 + (n - 1)d \, ]$
$1275 = \frac{1}{2}n[ \, 2(1) + (n - 1)(1) \, ]$
$2550 = 2n + n(n - 1)$
$2550 = 2n + n^2 - n$
$n^2 - n - 2550 = 0$
$(n - 51)(n + 50) = 0$
$n = 51 ~ \text{and} ~ -50$
There are 51 layers in the pile.