//David Hochman //C Language Program to Identify 5000 Digit Pythagorean Prime

include

int main (void) {

 for (x = 1; x <= 1000; x++)
      {
      y = x*y;
      }
      x--;

 printf("x = %d ; ", x);

//Identify Pythagorean Prime c //c = (x!)^2 + a^2

 do
 {
      for (b = 2; y*y + a*a >= b*b; b++)
           {
           if ((y*y + a*a)%b == 0)
                break;
           }
           a++;

      if (y*y + a*a < b*b)
           {
           printf("a = %d ; (x!)^2 + a^2 is a Pythagorean Prime", a - 1);
           count++;                                       
           }
 }while (count != 1);

 return 0;

}