olymmath

HMMT 2020 A10

  • Algebra and Number Theory

We define F101[x]\mathbb{F}_{101}[x] as the set of all polynomials in xx with coefficients in F101\mathbb{F}_{101} (the integers modulo 101 with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of xkx^{k} are equal in F101\mathbb{F}_{101} for each nonnegative integer kk. For example, (x+3)(100x+5)=100x2+2x+15(x+3)(100 x+5)=100 x^{2}+2 x+15 in F101[x]\mathbb{F}_{101}[x] because the corresponding coefficients are equal modulo 101. We say that f(x)∈F101[x]f(x) \in \mathbb{F}_{101}[x] is lucky if it has degree at most 1000 and there exist g(x),h(x)∈F101[x]g(x), h(x) \in \mathbb{F}_{101}[x] such that

f(x)=g(x)(x1001−1)+h(x)101−h(x)f(x)=g(x)\left(x^{1001}-1\right)+h(x)^{101}-h(x)

in F101[x]\mathbb{F}_{101}[x]. Find the number of lucky polynomials.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2020/a10 · Tag SGSX1SVEK6 · Edit this page on GitHub · Keys: j next, k previous