For each positive integer n, define f(n) to be the least positive integer for which the following holds:For any partition of {1,2,…,n} into k>1 disjoint subsets A1,…,Ak, all of the same size, let Pi(x)=∏a∈Ai(x−a). Then there exist i=j for which
deg(Pi(x)−Pj(x))≥kn−f(n)a) Prove that there is a constant c so that f(n)≤c⋅n for all n.b) Prove that for infinitely many n, one has f(n)≥ln(n). number theoryPolynomialsolympic revengealgebrapolynomial