6.1 (похоже на решето Эратосфена)

program prog;
var
    arr : array[1033..7737] of boolean;
    i, count, min, max : longint;
begin
    i := (1033 div 11 + 1) * 11;
    while (i < 7737) do begin
        arr[i] := true;;
        i := i + 11;
    end;
    i := (1033 div 17 + 1) * 17;
    while (i < 7737) do begin
        arr[i] := true;
        i := i + 17;
    end;
    i := (1033 div 19 + 1) * 19;
    while (i < 7737) do begin
        arr[i] := true;
        i := i + 19;
    end;
    i := (1033 div 23 + 1) * 23;
    while (i < 7737) do begin
        arr[i] := true;
        i := i + 23;
    end;
    count := 0;
    min := 7735;
    max := 1035;
    i := 1035;
    while (i < 7737) do begin
        if (not(arr[i])) then begin
            if (i > max) then
                max := i;
            if (i < min) then
                min := i;
            count := count + 1;
        end;
        i := i + 5;
    end;
    writeln('count = ', count, '; max = ', max, '; min = ', min);
end.