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;
}
}
A Tech publication for all. Get Knowledge about Web Development, Programming, and trending news, tutorials, and tools for beginners to experts.
Showing posts with label Series Program. Show all posts
Showing posts with label Series Program. Show all posts
Friday, September 23, 2016
Series Program : 1 3 8 15 27 50 92 169 311
1 3 8 15 27 50 92 169 311
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;
}
Subscribe to:
Posts (Atom)
-
1 23 456 78910 #include<stdio.h> int main() { int i,j,k; k=1; for(i=1;i<5;i++) { for(j=1;j<=i;j++) { printf("%d",k++);...
-
Learn how to configure Let’s Encrypt SSL on Windows 11 using Win-ACME and IIS. Securing your website with HTTPS is no longer optional—it’s a...
-
🌍 World Geo Data — Full Country, State, City & Currency Dataset This repository provides an overview of the World Geo Data digital pro...
-
Complete beginner-friendly guide to generate and install a free SSL certificate on Windows server If you’re running a website on Windows Se...
-
1 10 101 1010 10101 #include<stdio.h> int main() { int i,j,k; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%d",j%2)...
-
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++...
-
In my 20's I would ask mentors what they thought the most important key to success was. They all had different opinions. Then one gave m...
-
AAAAA BBBB CCC DD E #include <stdio.h> int main() { int i, j; for(i=1;i<=5;i++) { for(j=5;j>=i;j--) ...
-
54321 4321 321 21 1 CODE: #include <stdio.h> int main() { int i, j; for(i=5;i>=1;i--) { for(j=i;j>=1;j--) { printf("%d...
-
/* Transpose the matrix */ #include<stdio.h> int main() { int a[4][4],i,j,b; for(i=0;i<4;i++) { printf("\nEnter elements of %d...