define isprime(c) {
  auto i,root;
  if (c == 1) return (0);
  if (c == 2) return (0);
  if (c%2 == 0) return (1);
  root=1+sqrt(c);
  i=3;
  while (i<root && (c%i != 0)) {
      i+=2;
  }
  if (i<root) return (0);
  return (1);
  }
  
define findprime(m) {
     auto n,c;
     n=1;
     c=2;
     print "Finding the first ",m," positive prime numbers\n";
     print "+-----------------------------+\n";
     print "|      Count            Prime |\n";
     print "+-----------------------------+\n";
     print "|    ",n,"         ",c," |\n";
#     print n,"         ",c,"\n";
#     n+=1;
     c+=1;
     while (n<m) {
     	   if (isprime(c)) {
	      n+=1;
              print "|    ",n,"         ",c," |\n";
#              print n,"         ",c,"\n";
	      }
	   c+=2;
	   }
     print "+-----------------------------+\n";
}


a=findprime(10000);