Mathematics

Mathematics

Problem

Let f(x)=x13+2x12+3x11+⋯+13x+14f(x) = x^{13} + 2x^{12} + 3x^{11} + \dots + 13x + 14 and α=cos⁡2π15+isin⁡2π15\alpha = \cos \frac{2\pi}{15} + i \sin \frac{2\pi}{15} . If N=f(α)f(α2)…f(α14)N = f(\alpha)f(\alpha^2)\dots f(\alpha^{14}) , then a. number of divisors of NN is 144 b. number of divisors of NN is 196 c. number of divisors of NN which are perfect squares of 49 d. number of divisors of NN which are perfect square of 12
Intuitive explanation

The key insight is recognizing that α\alpha is a primitive 15th root of unity, so α15=1\alpha^{15} = 1 and the powers α,α2,…,α14\alpha, \alpha^2, \ldots, \alpha^{14} are all the non-trivial 15th roots of unity. Rather than computing each f(αk)f(\alpha^k) individually, look for a polynomial whose roots are related to these values—this often involves constructing a resultant or using the fact that products over roots of unity have elegant closed forms. The coefficients of ff form an arithmetic sequence, which may simplify the algebra significantly.

Intuitive explanation

The key insight is recognizing that α\alpha is a primitive 15th root of unity, so α15=1\alpha^{15} = 1 and the powers α,α2,…,α14\alpha, \alpha^2, \ldots, \alpha^{14} are all the non-trivial 15th roots of unity. Rather than computing each f(αk)f(\alpha^k) individually, look for a polynomial whose roots are related to these values—this often involves constructing a resultant or using the fact that products over roots of unity have elegant closed forms. The coefficients of ff form an arithmetic sequence, which may simplify the algebra significantly.

Browse the problem library