olymmath

RMM 2017 Problem 2

  • Day 1
  • Answer

Determine all positive integers nn satisfying the following condition: for every monic polynomial PP of degree at most nn with integer coefficients, there exists a positive integer k≤nk \leq n, and k+1k+1 distinct integers x1,x2,…,xk+1x_{1}, x_{2}, \ldots, x_{k+1} such that

P(x1)+P(x2)+⋯+P(xk)=P(xk+1)P\left(x_{1}\right)+P\left(x_{2}\right)+\cdots+P\left(x_{k}\right)=P\left(x_{k+1}\right)

Semen Petrov, Russia Note. A polynomial is monic if the coefficient of the highest power is one.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2

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

Locator rmm/2017/p2 · Tag HH8F2XZ821 · Edit this page on GitHub · Keys: j next, k previous