Arithmetic Progression formula proof

Kartik.
Messages
55
Reaction score
1
The proof says that -
Let,
Sn= a+(a+d)+(a+2d)+...+(a+(n-2)d)+(a+(n-1)d)----->1
Sn= (a+(n-2)d)+(a+(n-1)d)+...+a+(a+d)+(a+2d)------>2

Now if we have to add such things(1 and 2) how would we do that?
 
Mathematics news on Phys.org
Kartik. said:
The proof says that -
Let,
Sn= a+(a+d)+(a+2d)+...+(a+(n-2)d)+(a+(n-1)d)----->1
Sn= (a+(n-2)d)+(a+(n-1)d)+...+a+(a+d)+(a+2d)------>2

Now if we have to add such things(1 and 2) how would we do that?


Since there doesn't seem to be any explicit order in line (2) it is hard to know what you want...I'd rather do the following:

(1) == S_n=(a)+(a+d)+(a+2d)+...+(a+(n-2)d)+(a+(n-1)d)

(2) == S_n=(a+(n-1)d)+(a+(n-2)d)+...+(a+d)+(a) ...These two are the same sum in inverse order.

Now sum both lines (1)+(2) in the same order (from left to right):

2S_n=(2a+(n-1)d)+(2a+(n-1)d)+...+(2a+(n-1)d) = n(2a+(n-1)d) , and from here you obtain the well known formula.

DonAntonio
 
I am not sure what you are trying to do. It looks like one method of deriving the formula for the sum of an arithmetic series but, if so, you have the second sum wrong. You should be just "swapping ends" of the first series. You should have
a+ (a+ d)+ (a+ 2d)+ ...+ (a+ (n-2)d)+ (a+ (n-1)d and
(a+ (n-1)d+ (a+ (n-2)d)+ ...+ (a+ d)+ a

Now add "vertically". The two first numbers in each sum are a and a+ (n-1)d. They add to 2a+ (n-1)d, of course. The next term in each sum is a+d and a+ (n-2)d. They add to 2a+ (1+ n- 2)d= 2a+ (n- 1)d again. The next to last terms are a+ (n- 2)d and a+ d. The add to 2a+ (n-2+ 1)d= 2a+ (n-1)d once more. Finally, the last terms are a+ (n-1)d and a which add to, yet again, 2a+ (n-1)d.

Basically, as move to the right in the first sum, we are always adding "d". Since the second sum is just the first sum reverse, we add "d" as we move right which means that moving left we are subtracting "d". Because, adding vertically, we will have added d to one term and subtracted d from the other, the sums are always the same, 2a+ (n- 1)d. There are n terms so the sum of the two is n(2a+ (n-1)d. Since the two are the same, the sum of either one is half that" n(2a+ (n-1)d)/2.
 
HallsofIvy said:
I am not sure what you are trying to do. It looks like one method of deriving the formula for the sum of an arithmetic series but, if so, you have the second sum wrong. You should be just "swapping ends" of the first series. You should have
a+ (a+ d)+ (a+ 2d)+ ...+ (a+ (n-2)d)+ (a+ (n-1)d and
(a+ (n-1)d+ (a+ (n-2)d)+ ...+ (a+ d)+ a

Now add "vertically". The two first numbers in each sum are a and a+ (n-1)d. They add to 2a+ (n-1)d, of course. The next term in each sum is a+d and a+ (n-2)d. They add to 2a+ (1+ n- 2)d= 2a+ (n- 1)d again. The next to last terms are a+ (n- 2)d and a+ d. The add to 2a+ (n-2+ 1)d= 2a+ (n-1)d once more. Finally, the last terms are a+ (n-1)d and a which add to, yet again, 2a+ (n-1)d.

Basically, as move to the right in the first sum, we are always adding "d". Since the second sum is just the first sum reverse, we add "d" as we move right which means that moving left we are subtracting "d". Because, adding vertically, we will have added d to one term and subtracted d from the other, the sums are always the same, 2a+ (n- 1)d. There are n terms so the sum of the two is n(2a+ (n-1)d. Since the two are the same, the sum of either one is half that" n(2a+ (n-1)d)/2.


Thanks!..I was trying to do the thing you just demonstrated
 
DonAntonio said:
Since there doesn't seem to be any explicit order in line (2) it is hard to know what you want...I'd rather do the following:

(1) == S_n=(a)+(a+d)+(a+2d)+...+(a+(n-2)d)+(a+(n-1)d)

(2) == S_n=(a+(n-1)d)+(a+(n-2)d)+...+(a+d)+(a) ...These two are the same sum in inverse order.

Now sum both lines (1)+(2) in the same order (from left to right):

2S_n=(2a+(n-1)d)+(2a+(n-1)d)+...+(2a+(n-1)d) = n(2a+(n-1)d) , and from here you obtain the well known formula.

DonAntonio

Thanks ! :D
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top