*/

 Written by

 Cadar,Cristian        : cristic@mit.edu 
 Francu,Catalin A      : cata@mit.edu     
 Gheorghioiu,Ovidiu D  : ovy@mit.edu      

 October 11, 2001

 May be freely reproduced for educational or personal use
*/

// Test program. I'm trying to see if there exist primes of the form
// p = 12k + 7, q = 3k + 2, r = 2k + 1. This would give us an easy way
// to find generators in problem 3-2.

#include <stdio.h>

int prime(int n) {
  int i=3;
  if (!(n&1)) return 0;
  while (i*i<n) {
    if (n%i==0) return 0;
    i+=2;
  }
  return (i*i>n);
}

int main(void) {
  int p, q, r, k=1;
  for (;;k++) {
    r = 2*k + 1;
    q = 3*k + 2;
    p = 12*k + 7;
    if (prime(p) && prime(q) && prime(r))
      printf("%d %d %d\n", p, q, r);
  }
  return 0; /* Like it ever happens :-) */
}