First = X^1/1! - X^3/3! + X^5/5! - X^7/7! + X^9/9! - ....X^n/n!
Middle = n sigma i = 1 sqrt(i/x)
last = 1- X^2/2! + X^4/4! - X^6/6! + X^8/8! - ....X^n/n!
Final = first/last + middle
Code:
#include<iostream>
#include<cmath>
using namespace std;
int powerfunc (int x, int n)
{
int x, n;
int p, i;
while (i <=n)
{
p = p * x;
i = i + 1;
return p;
}
}
int factorial (int n)
{
int i, n;
int f = 1;
for (i = 1; i <= f; i++)
{
f *= i;
return f;
}
}
int sigma(int x, int n)
{
int i = 1, sum = 0;
int x, n;
while (i <= n)
{
sum += i * i;
i++;
sum = sqrt(sum/x)
return sum;
}
}
int main()
{
int x, n;
int first, middle, last, final;
do {
cout << “Please enter the value for x” << endl;
cin >> x;
cout << “Please enter the value for n” << endl;
cin >>n;
middle = sigma(x, n)
final = fist/(last + middle);
cout << “The value for first is << first << endl;
cout << “The value for middle is << middle << endl;
cout << “The value for last is << last << endl;
cout << “The value for final is << final << endl;
cout << "Do you want to calculate this again? (y/n): ";
cin >> ans;
} while (ans == 'y' || ans == 'Y');
..
getch ();
return 0;
}


