For any positive integer n, let Dn denote the greatest common divisor of all numbers of the form an+(a+1)n+(a+2)n where a varies among all positive integers.(a) Prove that for each n, Dn is of the form 3k for some integer k≥0.
(b) Prove that, for all k≥0, there exists an integer n such that Dn=3k. number theorygreatest common divisormodular arithmeticnumber theory unsolved