cari_prime

//fpc 3.0.0

program cari_prime;

  function is_prime(n:integer):boolean;
  var
    tmp_prime : boolean;
    i : integer;
  begin
    tmp_prime :=true;

    if(n=2)then
       tmp_prime :=true;
    begin
       i:=2;
       while (i<=sqrt(n)) and (tmp_prime) do
       begin
         if (n mod i = 0) then
            tmp_prime:= false;
         i:=i+1;
       end;
    end;
    is_prime:= tmp_prime;
  end;

  function fak(n:integer):integer;
  var
    i,hsl:integer;
  begin
     hsl:=1;
     for i:=1 to n do
         hsl:=hsl*i;
     fak:=hsl;
  end;

  function pangkat(a,b:integer):integer;
  var
    i,hsl : integer;
  begin
    hsl:=1;
    for i:=1 to b do
      hsl:=hsl*a;
    pangkat:=hsl;
  end;

var
 i,j : integer;
 prime : array[1..20] of integer;
 jml_prime:integer;
begin
  jml_prime:=1;
  for i:=1 to 1000 do
  begin
    if(is_prime(i))then
    begin
      prime[jml_prime]:=i;
      jml_prime:=jml_prime+1;
    end;
  end;

  for i:=1 to jml_prime do
  begin
     for j:=1 to jml_prime do
     begin
       if (fak(i-1)+1)=(i*(pangkat(j,6)+36)) then
          writeln(i,'  ',j);
     end;
  end;
end.