На, держи. Я кое-че переделал. =)
Code
program tyr;
uses crt;
Var n:integer;
mas : array [1..100] of integer;
i : integer;
f: boolean;
Function IsFibonacci(n: Integer): Boolean;
Var a, b, c: Integer;
Begin
a := 0;
b := 1;
While (b < n) do
Begin
c := a + b;
a := b;
b := c;
End;
If b = n then IsFibonacci := true
else IsFibonacci := false;
End;
Begin
clrscr;
Randomize;
Write('Massiv razmerom: '); Readln(n);
For i := 1 to n do
Begin
mas[i] := Random(30);
Write(mas[i], ' ');
End;
Writeln;
For i := 1 to n do
begin
If (IsFibonacci(mas[i])) then
Begin
writeln('true: ',mas[i],' - is fibonacci sequence part');
f := True;
Break;
End;
end;
If (f = False) then Writeln('False');
readkey;
End.