Let f(n) denote the sum of the digits of n. (a) For any integer n, prove that eventually the se quence f(n),f(f(n) ),f(f(f(n))), . . . will become constant. This constant value is called the digital sum of n. (b) Prove that the digital sum of the product of any two twin primes, other than 3 and 5, i...