Active forum topics
- Homework About Torsion
- Problems in progression
- Ceva’s Theorem Is More Than a Formula for Concurrency
- The Chain Rule Explained: Don't Just Memorize, Visualize It
- The Intuition Behind Integration by Parts (Proof & Example)
- Statics
- Calculus
- Hydraulics: Rotating Vessel
- Inverse Trigo
- Hydraulics: Water is flowing through a pipe
New forum topics
- Ceva’s Theorem Is More Than a Formula for Concurrency
- The Chain Rule Explained: Don't Just Memorize, Visualize It
- The Intuition Behind Integration by Parts (Proof & Example)
- Statics
- Calculus
- Hydraulics: Rotating Vessel
- Hydraulics: Water is flowing through a pipe
- Inverse Trigo
- Problems in progression
- General Solution of $y' = x \, \ln x$
Recent comments
- (a)
Max. shear at A = 12.73…1 week 5 days ago - mm equivalent of 6m3 months 2 weeks ago
- thankyouu!5 months 3 weeks ago
- z6 months ago
- Force P only impends motion…6 months ago
- Wow! :>6 months 2 weeks ago
- In general, the centroid of …6 months 3 weeks ago
- isn't the centroid of the…6 months 3 weeks ago
- I get it now, for long I was…7 months ago
- Why is BD Tension?
is it not…7 months 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.