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)…………………

Comments

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