Суммировать до тех пор, пока очередное слагаемое по модулю не станет меньше eps

program kursach;
type mass=array[1..12] of real;
var b:mass;
function sum(x:real;var eps:real):real;
 
  var p,t,i:integer; l,m:real;
 begin
 writeln('vvedite eps');
  read(eps);
  p:=1;
  t:=2;
  m:=0;
  repeat
  l:=sqrt(x*x*x+p)/(cos(x)+t*t);
  p:=p+2;
  t:=t+2;
  m:=m+l;
 until abs(l)<eps;
 sum:=m;
  writeln('vvedite 12 chisel');
   for i:=1 to 12 do
    read(b[i]);
    for i:=2 to 12 do
    begin
    x:=b[2];
    if (i mod 2=0) and (b[i]<x) then
    x:=b[i];
     end;
     
  writeln('sum=',sum);
 end;
 begin
 end.

program kursovaya;
const n=12;
var b:array [1..n] of real;
i:integer; M,min,e:real;
Function Summa(x,j:real):real;
var G,F:real;
m,n:integer;
begin
m:=1;
n:=2;
repeat
F:=sqrt(x*x*x+m)/(cos(x)+n*n);
m:=m+2;
n:=n+2;
G:=G+F;
until abs(F)<E;
Summa:=G;
end;
 
begin
Writeln ('Vvedite 12 chisel');
for i:=1 to n do
readln (B[i]);
writeln ('Vvedite E');
readln (e);
min:=B[1];
for i:=1 to n do begin
if i mod 2=0 then 
if B[i]<min then
min:=B[i];
end;
M:=Summa (e,min);
writeln ('Summa ravna ', M);
end.

Function Summa(x, j: real): real;
var G, F: real;
    n: integer;
begin
  n := 1;
  G := 0;
  repeat
    F := sqrt(x * x * x + 2 * n - 1)/(cos(x)+ 4 * n * n);
    inc(n);
    G := G + F
  until abs(F) < j;
  Summa := G
end;
 
const n = 12;
 
var b: array [1..n] of real;
    i: integer;
    min, e: real;
 
begin
  Writeln('Enter array B:');
  for i := 1 to n do
    begin
      write('B(', i:2, ') = ');
      readln(B[i]);
    end;
  repeat
    write('eps = ');
    readln(e);
    if e <= 0 then writeln('Error: eps <= 0, reenter.')
  until e > 0;
  min:=B[2];
  for i := 2 to n div 2 do if B[2 * i] < min then min := B[2 * i];
  writeln ('Sum = ', Summa(min, e));
  readln
end.