#include<stdio.h>
int isPrime(int x,int knownPrimes[],int numberofknownPrimes);
int main()
{
const int number =10;
int prime[number]={2};
int count =1;
int i =3;
while(count < number){
if( isPrime(i,prime,count)){
prime[count++]=i;
}
{
int i;
printf("\t\t\t\t");
for(i=0;i<number;i++){
printf("%d\t",i);
}
printf("\n");
}
i++;
}
for (i=0;i<number;i++){
printf("%d",prime[i]);
if( (i+1)%5)printf("\t");
else printf("\n");
}
return 0;
}
int isPrime(int x,