Wednesday, June 5, 2019

discrete mathematics - Sum of Arithmetic progression problem



I have following progression:




2n+(2n1)++n




which is equivalent to:





n+(n+1)++2n




The answer says:




You match 2ni with n+i for all i=0..n Therefore you have (n+1) terms
of 3n, so the sum of the 2 exactly same sequence is 3n(n+1) and
therefore the sum of 1 sequence is 1.5n(n+1)




Or you can just apply the formula for the sum of Arithmetic
progression, please refer to the wiki page
https://en.wikipedia.org/wiki/Arithmetic_progression




Thus, I tried applying sum of arithmetic progression since I need to make it "1.5n(n+1)". but when I apply sum of arithmetic progression, it gives me different result like "n2(2n+(n1)1)=1.5n20.5n"



How can I get "1.5n(n+1)"?


Answer




The sum of an artihmetic progression is (first term + last term)*(number of terms)/2.



Here :




  • first term=n,

  • last term=2n,

  • number of terms=n+1




Applying the formula, Sum=(n+2n)(n+1)2 reaches your desired result...


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...