Sum of Integers from 1 to n

In this lesson, we will learn how to find the sum of numbers from 1 to n using recursion.

What does the sum of integers from 1 to nn mean?

Natural numbers are all positive numbers starting with 11. These can be written as follows:

1,2,3,4,5,6,7,8,9,10......1,2,3,4,5,6,7,8,9,10......

We want to write a program that takes a specific number and adds all the numbers from 11 until that number.

For example, if n=5n = 5, the sum of numbers from 11 to 55 is: 1+2+3+4+5=151 + 2 + 3 + 4 + 5 = 15.

Mathematical Notation

Let’s write it down mathematically:

i=15i\sum_{i=1} ^{5} i

== 55 ++ i=14i\sum_{i=1} ^{4} i

== 55 ++ 44 ++ i=13\sum_{i=1} ^{3}

== 55 ++ 44 ++ 33 ++ i=12\sum_{i=1} ^{2}

.

.

.

=5+4+3+2+1=5+4+3+2+1

Generic Mathematical Notation

i=1ni\sum_{i=1} ^{n} i

== nn ++ i=1n1i\sum_{i=1} ^{n-1} i

== nn ++ (n1)(n-1) ++ i=1n2\sum_{i=1} ^{n-2}

.

.

.

== nn ++ (n1)(n-1) +(n2)+(n-2) $ … +2+1$

Implementation

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy