Categories: C++

Sum Of Series 1 + 2 + 3 + 4 + 5 + 6 . . . . n

The sum of a series consisting of n terms beginning with “1,” is equivalent to the sum of n natural numbers beginning with 1. There are numerous approaches to solving the same problem, but the ones listed below are the most commonly used by coders.

Program code:

#include<iostream>
using namespace std;
int sumseries(int num)
{
    int sum=0;
    sum=num*(num+1)/2;
    return sum;
}

int main()
{
    int n;
    cout<<"Enter the value of n : ";
    cin>>n;
    cout<<sumseries(n);
    return 0;
}
Output:
Enter the value of n : 6
21

As one can see in the above code, we directly used the formula for the sum of ‘n’ natural numbers.

Note: also read about Program to Find ASCII Value of a Character

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

2 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

1 year ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

1 year ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

1 year ago