112233nn formula. What is the sum of 11. Using the method of colorblueproof by induction this involves the following steps prove true for some value say n 1 assume the result is true for n k. Showing that the formula holds true for n k 1.
You get it by observing the series. 112233nn n1 1 first we prove its true for n1 11 11 1 and 11 1 2 1 2 1 1 now. Please try your approach on first before moving on to the solution.
Math central is supported by the university of regina and the pacific institute for the mathematical sciences. There isnt any mathematical formula to calculate sum of this series as kanak dhotre mentioned in his answer. But yesyou can calculate sum of this series by programming.
N 2 output. Sum of nn from 1 to infinity is it. So obviously the series is a sum of nn.
Therefore by the principle of mathematical induction 13 23 33. For example if you want to calculate sum of this series u. Stack exchange network consists of 176 qa communities including stack overflow the largest most trusted online community for developers to learn share their knowledge and build their careers.
N3 nn 122 for all natural numbers n. N n using recursion. Given an integer n the task is to find the sum of the series 1 1 2 2 3 3.
Here is one method to derive the formula for the sum of squares which can be extended to other integer powers. Observe that texk13 k3 3k2 3k 1tex. You can put this solution on your website.
Satya krishna kanth munuganti cpl holder msdropout aerospace and aeronautical engineering purdue university 2019 answered march 11 2018. N 3 output.
Number Sequences Lecture 7 Sep 29 Overhang This Lecture We Will Study Some Simple Number Sequences And Their Properties The Topics Include Representation Ppt Download
slideplayer.com