olymmath

HMIC 2016 Problem 5

    Let S={a1,…,an}S=\left\{a_{1}, \ldots, a_{n}\right\} be a finite set of positive integers of size n≥1n \geq 1, and let TT be the set of all positive integers that can be expressed as sums of perfect powers (including 1) of distinct numbers in SS, meaning

    T={∑i=1naiei∣e1,e2,…,en≥0}T=\left\{\sum_{i=1}^{n} a_{i}^{e_{i}} \mid e_{1}, e_{2}, \ldots, e_{n} \geq 0\right\}

    Show that there is a positive integer NN (only depending on nn ) such that TT contains no arithmetic progression of length NN.

    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 hmic/2016/p5 · Tag XF1EMW9DMS · Edit this page on GitHub · Keys: j next, k previous