SOLUTION: Prove that: {{{sum((2k-1^"")^""^""^"",k=1,n)}}}{{{""=""}}}{{{sum( ((n^2-1)/n^2)^(k-1),k=1,infinity)}}}

Algebra.Com
Question 1018961: Prove that:
Answer by Edwin McCravy(20056)   (Show Source): You can put this solution on YOUR website!
Prove that:


The left side is the sum of the arithmetic series:

1 + 3 + 5 + ... + 2n-1

The formula for this sum is



where a1 = 1 and an = 2n-1 



--------

Now we see if we can show that the right side is also 
equal to n2.


The right side is the sum of an infinite geometric series

The formula for this sum is 



where a1 = 1 and  



So the right side also equals n2. 
That proves they are equal.

Edwin
RELATED QUESTIONS

Prove that {{{6/(n+1) <= 6/(2n+1) +sqrt(sum(1/k^2, k=1,n))}}} for {{{n >=... (answered by Edwin McCravy)
Let {{{N = N[1] + N[2]}}} , and {{{1 <= k <= N[1]}}} and {{{1 <= k <= N[2]}}}. Prove... (answered by robertb)
Find a and b if {{{sum( ak+b, k=1, n ) = 8n^2+11n}}}, given that {{{sum( k, k=1, n ) =... (answered by Edwin McCravy,Bakr.R)
Find the sum in terms of n for n ∑ {{{ (3k^2-5k+7) }}} k=1 Given: n ∑= (answered by greenestamps)
Use the Binomial Theorem to express the following sum in closed form (without using a... (answered by ikleyn)
prove that (n 0) + (n 1) + (n 2) + ... + (n k) = 2^n is true using mathematical induction (answered by Shin123,ikleyn)
PLEASE HELP!!! Prove that U (n choose k-1) + (n choose k)=(n+1 choose k) for all... (answered by KMST)
Prove by induction that 2^n>=n^2. I was stocked at the induction step when... (answered by richard1234)
1. prove that: n²-1000n-> infinity as n-> infinity 2. use standard results to show... (answered by Edwin McCravy)