Find the sum.
\[1 + 3 + 5 +...+ (2n -1)\]
Use\[\Large \sum_{k=1}^n k= \frac{n(n+1)}{2} \]
i know how to do these types of problems, i just got stuck on this one.
@Directrix no its not like how you mention.
\[ \Large \sum_{k=1}^n [2k-1]=\sum_{k=1}^n 2k-\sum_{k=1}^n1 \]
it's an AP
@mathslover what?
Then, you want the sum in terms of n, I suppose.
why don't you use the AP sum formula ? See , AP is arithmetic progression
Here we have d (common difference) as 2 .. Hey, before I get back to the complete work started, can you tell me that have you learnt Arithmetic Progression @some_someone
@mathslover yes i have.
fine, so can you tell me the formula for Sum of an AP
i am not sure, can you tell it to me, and i will tell you if i have used it.
OK! it is : \[\large{S_n = \frac{n}{2} (2a + (n-1)d)}\] where n is the number of observations . a is the first term d is the common difference
oh its that one, yes i know it ^.^
hmn. Well @some_someone lemme know exactly that which topic were you doing when you encountered with this question ??
ok however, i use also \[S _{n} = \frac{ n }{ 2 }(a _{1} + a _{n})\]
that's also right..
the sum of the first n odd number is \(n^2\)
yeah i know, that is the one i have been using
OK I got it.
let the number of observations be "k"
you can see it with a picture
@satellite73 , the sum is \[n^2 \] and that is the answer i just dont know how to get to that answer?
then we have : \[\large{S_k = \frac{k}{2} (2(1) + (k-1)2)}\] \[\large{S_k = \frac{k}{2} (2(1+k-1))}\] \[\large{S_k = k (1 + k -1 )}\] \[\large{S_k = k ( \cancel{1} + k - \cancel{1})}\] \[\large{S_k = k^2}\] Proved
pattern is clear for one thing \[1=1\]\[1+3=4\]\[1+3+5=9\]\[1+3+5+7=16\]
@satellite73 instead of mathematical induction, we can also prove it algebraically
you don't even need algebra, a picture will do it
Yes but I believe in proving it algebraically . well, @some_someone did you get it ?
can u use the formula i gave you to show me?
Yes @some_someone I used that
See I have : \[\large{S_n = \frac{n}{2} (2a + (n-1)d)}\] Right?
no
why ?
\[\large{S_n = \frac{n}{2} (a_1 + a_n)}\] ? this one ?
yes
OK now , put a_1 = 1 and a_nn = 2n-1 , note that we are given with this information . Can you solve it ?
hmmm... idk
how about this \[n^2=\sum_{k=1}^nk^2-(k-1)^2=\sum_1^n k^2-(k^2-2k+1)=\sum_{k=1}^n 2k-1\]
i dont get it?
the line i wrote or above it?
urs?
OK satellite sir will explain you, I think he is good at that. I will recommend you @some_someone to understand the way @satellite73 sir is explaining.
\[\sum_{k=1}^nk^2-(k-1)^2\] is a telescoping sum the only term that survives is the last one , \(n^2\)
the rest is algebra, showing that \[k^2-(k-1)^2=2k-1\]
@satellite73 @mathslover so i did the following \[S _{n} = \frac{ n }{ 2 }(a _{1} + a _{n})\] \[S _{n} = \frac{ n }{ 2 }(1 + 2n-1)\] \[S _{n} = \frac{ n }{ 2 }(2n)\] am i doing it right?
looks good to me
OK you're right @some_someone but did you get the method suggested by satellite sir?
no :(
Hmn... leave that ,,, you are OK in AP ?
yep :) thanx everyone :D
Join our real-time social learning platform and learn together with your friends!