#include <stdio.H>
#include <math.h>
int prime(int m)
{
int i,n;
if(m==1)return 0;
n=(int)sqrt((double)m);
for(i=2;i<=n;i++)
if(m%i==0)return 0;
return 1;
}
void main()
int count,i,number;
count=0;
for(number=6;number<=20;number=number+2)
for(i=3;i<=number/2;i=i+2)
if(prime(i)&&prime(number-i))
printf("%d=%d+%d ",number,i,number-i);
count++;
if( count%5==0 )printf("\n");
continue;
#include <stdio.H>
#include <math.h>
int prime(int m)
{
int i,n;
if(m==1)return 0;
n=(int)sqrt((double)m);
for(i=2;i<=n;i++)
if(m%i==0)return 0;
return 1;
}
void main()
{
int count,i,number;
count=0;
for(number=6;number<=20;number=number+2)
{
for(i=3;i<=number/2;i=i+2)
if(prime(i)&&prime(number-i))
{
printf("%d=%d+%d ",number,i,number-i);
count++;
if( count%5==0 )printf("\n");
continue;
}
}
}