... + Cách suy for N C (1) = ph c t p: Gi s N = 2n C(2n) = 2C(2n -1 ) + C(2n)/ 2n = 2C(2n -1 ) / 2n + 1/ 2n =C(2n -1 ) / 2n -1 + 1/ 2n =[C(2n-2)/ 2n-2 + 1/ 2n -1 ]+ 1/ 2n =C(2n-i)/ 2n -i + 1/ 2n – i +1 + … + 1/ 2n ... nh p H th c truy h i CN = 2CN/2 + N for N C1 = Cách suy ph c t p: Assume N = 2n C(2n) = 2C(2n -1 ) + 2n C(2n)/2n = C(2n -1 ) / 2n -1 + = C(2n-2)/ 2n-2 + +1 =n C(2n ) = n.2n CN = NlgN CN NlgN 53 Thí ... = else factorial: = N*factorial (N -1 ) ; end; 13 H th c truy h i Th d 2: S Fibonacci H th c truy h i: FN = FN -1 + FN-2 for N F0 = F1 = 1, 1, 2, 3, 5, 8, 13 , 21, … ( integer): integer; function...