Categories: C++

Sum Of Series 1 + 2 + 4 + 8 + 16 + 32 + . . n

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;
}
Output:
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

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

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…

3 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…

2 years ago

DSA: Trie

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

2 years ago

Trees: Lowest Common Ancestor

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

2 years ago