Showing posts with label Series Program. Show all posts
Showing posts with label Series Program. Show all posts

Friday, 23 September 2016

Series Program : 1 3 8 15 27 50 92 169 311

1 3 8 15 27 50 92 169 311
void main()
{
int a=1, b=3, c=4, n=10, sum, i;
printf("%d %d ",a,b,c);
for(i=4; i<=n; i++)
{
sum = a+b+c;
printf("%d ",sum);
a = b;
b = c;
c = sum;
}
}

Series Program : 2 15 41 80 132 197 275 366 470 587

2 15 41 80 132 197 275 366 470 587

 
int main()
{
int a=2,i,n=10;
for(i=1;i<=n;i++)
{
printf("%d ",a);
a+=13*i;
}
return 0;
}

Series Program : 1 2 3 6 9 18 27 54...

1 2 3 6 9 18 27 54...
int main()
{
int a=1,b=2,i,n=10;
printf("%d %d ",a, b);
for(i=3;i<=n;i++)
{
if(i%2==1)
{
a=a*3;
printf("%d ",a);
}
else
{
b=b*3;
printf("%d ",b);
}
}
return 0;
}

Series Program : 1/2 - 2/3 + 3/4 - 4/5 + 5/6 - ...... n

1/2 - 2/3 + 3/4 - 4/5 + 5/6 - ...... n
int main()
{
double i, n,sum=0;
n=10;
for(i=1;i<=n;i++)
{
if ((int)i%2==1)
sum+=i/(i+1);
else
sum-=i/(i+1);
}
printf("Sum: %lf",sum);
return 0;
}

Series Program : [(1^1)/1] + [(2^2)/2] + [(3^3)/3] + [(4^4)/4] + [(5^5)/5] + ... + [(n^n)/n]

[(1^1)/1] + [(2^2)/2] + [(3^3)/3] + [(4^4)/4] + [(5^5)/5] + ... + [(n^n)/n]
long power(int a, int b)
{
long i, p=1;
for(i=1;i<=b;i++)
{
p=p*a;
}
return p;
}

int main()
{
long i,n;
double sum=0;
n=5;
for(i=1;i<=n;i++)
{
sum=sum+(power(i,i)/i);
}
printf("Sum: %lf",sum);
return 0;
}

Series Program : (1!/1) + (2!/2) + (3!/3) + (4!/4) + (5!/5) + ... + (n!/n)

(1!/1) + (2!/2) + (3!/3) + (4!/4) + (5!/5) + ... + (n!/n)
long fact(int n)
{
long i, f=1;
for(i=1;i<=n;i++)
{
f=f*i;
}
return f;
}

int main()
{
long i,n;
double sum=0;
n=5;
for(i=1;i<=n;i++)
{
sum=sum+(fact(i)/i);
}
printf("Sum: %lf",sum);
return 0;
}

Series Program : (1^1) + (2^2) + (3^3) + (4^4) + (5^5) + ... + (n^n)

(1^1) + (2^2) + (3^3) + (4^4) + (5^5) + ... + (n^n)
long power(int a, int b)
{
long i, p=1;
for(i=1;i<=b;i++)
{
p=p*a;
}
return p;
}

int main()
{
long i,n,sum=0;
n=5;
for(i=1;i<=n;i++)
{
sum=sum+power(i,i);
}
printf("Sum: %d",sum);
return 0;
}

Series Program : 1! + 2! + 3! + 4! + 5! + ... + n!

1! + 2! + 3! + 4! + 5! + ... + n!
long fact(int n)
{
long i, f=1;
for(i=1;i<=n;i++)
{
f=f*i;
}
return f;
}

int main()
{
long i,n,sum=0;
n=5;
for(i=1;i<=n;i++)
{
sum=sum+fact(i);
}
printf("Sum: %d",sum);
return 0;
}

Series Program : (1) + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n)

(1) + (1+2) + (1+2+3) + (1+2+3+4) + ... + (1+2+3+4+...+n)
int main()
{
int i,j,n,sum=0;
n=10;
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
sum+=j;
}
}
printf("Sum: %d",sum);
return 0;
}

Series Program : (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + ... + (n*n)

(1*1) + (2*2) + (3*3) + (4*4) + (5*5) + ... + (n*n)
int main()
{
int i,n,sum=0;
n=10;
for(i=1;i<=n;i++)
{
sum+=i*i;
}
printf("Sum: %d",sum);
return 0;
}

series program : 1 + 2 + 3 + 4 + 5 + ... + n

1 + 2 + 3 + 4 + 5 + ... + n
int main()
{
int i,n,sum=0;
n=10;
for(i=1;i<=n;i++)
{
sum+=i;
}
printf("Sum: %d",sum);
return 0;
}

Featured post

India’s Own Marketplace for Small Online Jobs

India’s Own Marketplace for Small Online Jobs: Empowering Freelancers and Small Businesses In recent years, India has seen a huge shift in ...