Saturday, August 20, 2011

Find twin prime numbers.

//Program to find twin prime numbers.
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
 int pr,i=0,k,flag=1,j,a[25],n;
 clrscr
 ();
 n=0;
 printf("prime numbers");
 while(n<=100)
 {
   if(n==0||n==1)
   {
    n=n+1;
    continue;
   }
   k=sqrt(n);
   for(j=2;j<=k;j++)
   {
    if((n%j)==0)
    {
     flag=0;
     break;
    }
    else
    {
    flag=1;
    }
   }
   if(flag==1)
    {
    a[i]=n;
    printf("%d,",n);
    i+=1;
    }
    n=n+1;
  }
  printf("\n Number of primes %d",i);
  for(i=0;i<24;i++)
  {
   if(a[i+1]-a[i]==2)
   {
    printf("\n %d and %d are the twin primes",a[i],a[i+1]);
   }
  }
  getch();
}

Previous Next Home
0 Comments
Comments

Leave a Comment

:)) ;)) ;;) :D ;) :p :(( :) :( :X =(( :-o :-/ :-* :| 8-} :)] ~x( :-t b-( :-L x( =))

Twitter Delicious Facebook Favorites More