olymmath

CONO-SUR 2021 Problem 5

    Given an integer n≥3n \geq 3 , determine if there are nn integers b1,b2,…,bnb_1, b_2, \dots , b_n , distinct two-by-two (that is, bi≠bjb_i \neq b_j for all i≠ji \neq j ) and a polynomial P(x)P(x) with coefficients integers, such that P(b1)=b2,P(b2)=b3,…,P(bn−1)=bnP(b_1) = b_2, P(b_2) = b_3, \dots , P(b_{n-1}) = b_n and P(bn)=b1P(b_n) = b_1 .

    Dataset text AI-MO AoPS. 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 cono-sur/2021/p5 · Tag 77RJBSMYR1 · Edit this page on GitHub · Keys: j next, k previous