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;
}
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
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
Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…