olymmath

AUSTRIAN-POLISH 1980 Problem 2

    A sequence of integers 1=x1<x2<x3<...1 = x_1 < x_2 < x_3 <... satisfies xn+1≤2nx_{n+1} \le 2n for all nn . Show that every positive integer kk can be written as xj−xix_j -x_i for some i,ji, j .

    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 austrian-polish/1980/p2 · Tag 5FMK3N7N53 · Edit this page on GitHub · Keys: j next, k previous