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

What is object oriented design patterns

A design pattern is a reusable solution to a commonly occurring problem in software design. They…

1 week ago

Factory Method Design Pattern in OODP

Factory Method is a creational design pattern that deals with the object creation. It separates…

2 weeks ago

Find Intersection of Two Singly Linked Lists

You are given two singly linked lists that intersect at some node. Your task is…

6 months ago

Minimum Cost to Paint Houses with K Colors

A builder plans to construct N houses in a row, where each house can be…

6 months ago

Longest Absolute Path in File System Representation

Find the length of the longest absolute path to a file within the abstracted file…

7 months ago

Efficient Order Log Storage

You manage an e-commerce website and need to keep track of the last N order…

7 months ago