For each positive integer k and n, let Sk(n) be the base k digit sum of n. Prove that there are at most two primes p less than 20,000 for which S31(p) are composite numbers with at least two distinct prime divisors. number theory unsolvednumber theory