... F:=1; if n>1 then F:=F(n-1)+F(n-2);end;BEGIN write('nhap so fibonacci thu n');readln(n); Fib:=F(n); write(&apos ;So fibonacci thu',n,'la: ',Fib); readln;end.* kết ... fibcache:=cache[n];end;BEGIN write('nhap so nguyen n= ');readln(n); cache[1]:=1; cache[2]:=1; for i:=3 to n do cache[i]:=UNKNOWN; Fib:=fibcache(n); write(&apos ;so fibonacci thu F',n,' ... integer; n,i:integer;BEGIN write('nhap so nguyen n ');readln(n); F[1]:=1; F[2]:=1; for i:=3 to n do F[i]:=F[i-1]+F[i-2]; writeln(&apos ;so fibonacci thu ',n,'la ',F[n]);...