Skip to main content

Generate twin primes below 100.( (3,5), (5,7), ……………).

PROCEDURE:-

    1.set n to 2
    2.check the first prime
    3.check the next prime by incrementing the n value
    4. check the diff. of second prime to first prime (they are twin prime if the difference is 2)
    6.repeat the process in steps 2 to  4 so as to generate all twin primes below 100  
CODE:-

#include<stdio.h>
void main( )
{
  /* n value is 2 because we are checking 1-100 twin primes, 1 is not prime,
       b can have any value initially,here it is 2, later on b value will be a value of  a*/
  int i,b=2,n=2,a,ctr;
 while(n<100)
 {
    ctr=0;   i=2;
     while(i<n)   /* logic for to check non prime numbers */
     {
       if(n%i = =0)
        {
     ctr=1; break;
        }
            i++;
    }
   if(ctr= =0)
    {
      a=n;           /* assining the value of n to a */
     if((a-b)= = 2)
        {
          printf(“( %d , %d) \n”,b,a);
         }
      b=a;  /* assining the value of a to b( it will assign only the prime no’s (i.e) the value of  a ) */
     }
   n++;
 }
}


Output:- (3,5) (5,7) (11,13)…………………
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