Constant n=8, A0=1, B0=1, C=10; //n>4
ConstStr A1=1+x, B1=2+x;
ConstStr For(i=2:n+1)(A[i]=(i+x)*A[i-1]-A[i-2]),
         For(i=3:n)(B[i-1]=(i+x)*B[i-2]-B[i-3]);
Function A[n+1]-B[n-1]=C;

2楼: Originally posted by dingd at 2012-09-22 20:56:26
用1stOpt试了下，不知对否，参考下：
假设C=10，n取8

Constant n=8, A0=1, B0=1, C=10; //n>4
ConstStr A1=1+x, B1=2+x;
ConstStr For(i=2:n+1)(A=(i+x)*A-A),
         For(i=3:n)(B=(i+x)*B-B);
Funct ...

Constant n=20, A0=1, B0=1, C=10; //n>4
ConstStr A1=1+x, B1=2+x;
Parameter x;
StartProgram [Pascal];
Procedure MainModel;
var i: integer;
    A, B: array of double;
Begin
    setlength(A, n+2);
    setlength(B, n);
    for i := 2 to n + 1 do begin
        if i = 2 then A[i]:=(i+x)*A1-A0
        else if i = 3 then A[i]:=(i+x)*A[2]-A1
        else A[i]:=(i+x)*A[i-1]-A[i-2];
    end;
    for i := 3 to n do begin
        if i = 3 then B[i-1]:=(i+x)*B1-B0
        else if i = 4 then B[i-1]:=(i+x)*B[2]-B1
        else B[i-1]:=(i+x)*B[i-2]-B[i-3];
    end;
    ObjectiveResult := sqr(A[n+1]-B[n-1]-C);
End;
EndProgram;