Program code:
#include <iostream>
#include <math.h>
using namespace std;
//calculating the sum of the series
double calc_sum(int n)
{
int i;
double sum = 0.0;
for(i=0;i<n;++i)
sum+=pow(2,i);
return sum;
}
int main()
{
int n;
cout<<"Enter the value of n :";
cin>>n;
double res = calc_sum(n);
cout << res << endl;
return 0;
}
Enter the value of n :5
31
Main Logic used here:
for(i=0;i<n;++i)
sum+=pow(2,i);
Note: also read about Sum Of Series 1 + 2 + 3 + 4 + 5 + 6 . . . . n
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…