Q1. S1. 4 = -3 mod 7 5 = -2 mod 7 9 = 2 mod 7 And 7 | 98 So for each odd p 7 | f(p) => for each p>=3. For p = 2, f(2) = 9 + 16 + 25 + 81 - 98 = 131-98 = 33 = 3*11 So f(2) has 4 divisors. Similarly 3^1 = 3 mod 11 3^2 = 9 mod 11 3^3 = 5 mod 11 3^4 = 4 mod 11 3^5 = 1 mod 11 So powers of 3 start cycling from exponent 5 onwards mod 11. So 9 = 3^2, 5 = 3^3 4 = 3^4 Basically f(p) = 3^p + 3^4p + 3^3p + 3^2p +1 mod 11 p,2p,3p,4p will give remainders 1,2,3,4 in some order modulo 5 as long as p is not 5. So f(p) = 3 + 9 + 4 + 5 + 1 mod 11 always for p != 5 f(p) = 22 mod 11 = 0 mod 11 for each prime p != 5 So 77 | f(p) for each prime p != 2,5 So 4 divisors are guaranteed for each prime p. And f(p) = 7^a.11^b Cases for (a,b) (1,1)(2,1)(1,2) which will give 4,6,6 divisors. And f(p) = 77,539,847 because any higher power of 7 or 11 will raise divisor count > 6. f(3) = 847 So 77,539 are not possible. And hence any f(p) above 3(except 5 which is yet to be checked) is not possible since that wou...