Mock Paper
Mock Paper
Soupayan Dasgupta
Total Marks: 80
Duration: 2 hours
1. Let f : N → N be a function such that f (f (n)) is the number of positive divisors of n. Prove that if n is a prime, then
f (n) is a prime. [10]
2. Given the polynomial P (x) = (x2 − 7x + 6)2n + 13, where n is a positive integer, show that P (x) cannot be written as
a product of n + 1 non-constant polynomials with integer coefficients. [10]
Sn = xn1 + xn2 , n ≥ 0.