Algoritmo de Conjectura de Goldbach

Em Delphi
function TForm1.ehPrimo1(n:Int64 ):boolean;
var v:boolean;
    sq,i:Int64 ;
begin
if (n mod 2 = 0) and (n>2) then v:=false else v:=true;
if v then begin
          sq:=round(sqrt(n));i:=3;
          while v and (i<=sq) do if (n mod i) = 0 then v:=false else begin inc(temp);inc(i,2);end;
          end;
Result:=v;
end;

function TForm1.Goldbach2(i:Int64 ):string; // SEQUENCIA,  i:numero par >=4; 
var d1,d2:Int64 ;
    s,s1:string;
    v:boolean;
begin
s1:='';
p1:=0;
d1:= 2;
    v:=true;
    while (d1<i) do
      begin
      d2:= 2;
      while (d2<=d1) do
        begin
        if d1+d2 = i then
                          begin
                          if CheckBox1.Checked then
                            begin
                            s:=inttostr(d1)+' + '+inttostr(d2);
                            s1:=s1+s+'; ';
                            end;
                          inc(p1);
                          end;
        inc(d2); while not ehprimo1(d2) do inc(d2);
        end;
      if v then begin inc(d1);  while not ehprimo1(d1) do inc(d1);end;
    end;
  result:= s1;
end;