olymmath

HMMT 2015 U19

  • Guts
  • Answer

Find the smallest positive integer nn such that the polynomial (x+1)n−1(x+1)^{n}-1 is "divisible by x2+1x^{2}+1 modulo 3 ", or more precisely, either of the following equivalent conditions holds:

  • there exist polynomials P,QP, Q with integer coefficients such that (x+1)n−1=(x2+1)P(x)+3Q(x)(x+1)^{n}-1=\left(x^{2}+1\right) P(x)+3 Q(x);
  • or more conceptually, the remainder when (the polynomial) (x+1)n−1(x+1)^{n}-1 is divided by (the polynomial) x2+1x^{2}+1 is a polynomial with (integer) coefficients all divisible by 3 .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

8

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/2015/u19 · Tag 164M6D1J47 · Edit this page on GitHub · Keys: j next, k previous