Special Facts to Know
... Fibonacci – F0 = 0, F1 = 1, Fn = Fn-1 + Fn-2 for n > 1 Lucas – F0 = 2, F1 = 1, Fn = Fn-1 + Fn-2 for n > 1 Let s(n) be the sum of all the proper factors of n. Deficient – s(n) < n Perfect – s(n) = n Abundant – s(n) > n Let d(n) be the total number of digits in the prime factorization of n. Frugal / E ...
... Fibonacci – F0 = 0, F1 = 1, Fn = Fn-1 + Fn-2 for n > 1 Lucas – F0 = 2, F1 = 1, Fn = Fn-1 + Fn-2 for n > 1 Let s(n) be the sum of all the proper factors of n. Deficient – s(n) < n Perfect – s(n) = n Abundant – s(n) > n Let d(n) be the total number of digits in the prime factorization of n. Frugal / E ...
