Solve Summation of Terms Upto n: Urgent Help

avistein
Messages
48
Reaction score
1
Find the sum upto n terms:

1.3.5+3.5.7+5.7.9....tn

I solve it this way:

tn=(2n-1)(2n+1)(2n+3)
Now can I take summation on both sides? How?

I mean when I add 2 on both sides the resultant is 0(2-2=0).Similarly the resultant summation will be zero?

And if I take summation I get one term as 3Ʃ.Now in a book I saw that it is 3n. Why? Summation of 3 will be 3 only as 3 is constant.Please explain.

I got this:


Ʃtn=Ʃ(2n-1)(2n+1)(2n+3)

Ʃtn=Ʃ[(4n^2-1)(2n+3)]
Ʃtn=Ʃ[8n^3 + 12n^2 - 2n - 3]

Ʃtn=Ʃ[8n^3] + Ʃ[12n^2] - Ʃ[2n] -Ʃ[3]

Ʃtn=8*Ʃ[n^3] + 12*Ʃ[n^2] - 2*Ʃ[n] - Ʃ[3]

Now do I require to write them as Ʃ[3] or 3Ʃ (putting a constant outside Ʃ).Please explain the whole summation process.I am stuck here.
 
Mathematics news on Phys.org
Hi.

You are on the right way.

As for Ʃtn=8*Ʃ[n^3] + 12*Ʃ[n^2] - 2*Ʃ[n] - Ʃ[3], there are formula for Ʃ[n^3], Ʃ[n^2], Ʃ[n] and Ʃ[1].
 
avistein said:
Summation of 3 will be 3 only as 3 is constant

No. Summing a constant depends on how many times you sum it.

For example,

\sum_{i=1}^4 10 = 10 + 10 + 10 + 10 = (4)(10) = 40
 
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