00:01
So let's look at the first.
00:03
This is k -1 and each term is k.
00:10
So we know that this is very simple arithmetic programming.
00:14
So for a uniform, you know, arithmetic program for this term, k, and could be written as a divided by 2 and a1, 10, 1 ,000, 8, 10, right? and for all the problems here, 1, 2, 10, actually this could be written 10 over 2, and the first term here is 1.
00:59
And the last term is 10.
01:01
So it's 5, 25, 11, so it's 55.
01:09
So for the second one, it's amazing from 1 to 10.
01:14
And each term run as k squared.
01:24
And this is also very famous progression.
01:28
So for a more uniform expression will be written as k from 1 to last term n and k to k square.
01:44
And this could be written as this.
01:51
So n -mort t is xx1 n plus 1 and 2 n plus 1 and over 6.
02:03
So this is uniformed solution for the summation of this kind of progress.
02:08
So for our problem here, so this really we can allow that the total terms 10...