Skip to main content

Evaluate the sin(x) series(1-x2/2!+x4/4!-….

PROCEDURE:-

    1.input values for degrees x and the number of terms to be added n
    2.convert the given degrees to radians
    3.substitute in the series to find the sum
    4.print the sum  
CODE:-

#include<stdio.h>
void main()
{
int i=1,n,y;
float sum,t,x;
printf(“enter the number of terms and degrees”)
scanf(“%d %d”,&n,&y);
x=y*3.142/180;
sum=1;
t=1;
while(i<n)
{
      t=((-t)*x*x)/((2*i)*(2*i-1));
       sum=sum+t;
       i++;
}
printf(“ sin(%d)=%f”,y,sum);
}


Input:- enter the number of terms and degrees 10 30
Output:-sin(30)=0.49999
Labels:

Comments

Post a Comment

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200
1 comment
Read more

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime  
Post a Comment
Read more