(3) Let A = a + a + a + a +1 where a is a positive odd integer such that a = 0 mod 5. Show that: (a) p = 1 mod 10 for any prime divisor p of A. (b) There are infinitely many primes of the form 10k +1 without using the Dirichlet's Theorem on arithmetic progressions.