Answer:
I don't know the exact answer but it is below 60
Step-by-step explanation:
Answer:
15m I think
Step-by-step explanation:
Sorry if im wrong
Answer:
Step-by-step explanation:
a: Wrong. The first thing that you have to notice is that the sum goes to infinity. If you want k=4 to be the last condition, then take out the 3 dots.
b: That's the answer.
c: wrong. You get a real mess when you let set k = 0. Try it on your calculator.
1 ÷ 0 = Watch carefully as your calculator mentally melts down.
d: wrong. It's just not right. The highest power is k^2. There is no way to get k^3
Let

In order to prove this by induction, we first need to prove the base case, i.e. prove that P(1) is true:

So, the base case is ok. Now, we need to assume
and prove
.
states that

Since we're assuming
, we can substitute the sum of the first n terms with their expression:

Which terminates the proof, since we showed that

as required
Si 1,2,4,5,8,10,16,20,40,80