olymmath

IR-TST 2002 Problem 12

    We call a permutation (a1,a2,...,an)\left(a_1, a_2, ..., a_n\right) of (1,2,...,n)\left(1, 2, ..., n\right) quadratic if there exists at least a perfect square among the numbers a1a_1 , a1+a2a_1 + a_2 , ...... , a1+a2+...+ana_1 + a_2 + ... + a_n . Find all natural numbers nn such that all permutations in SnS_n are quadratic.

    Remark. SnS_{n} denotes the nn -th symmetric group, the group of permutations on nn elements.

    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 ir-tst/2002/p12 · Tag 5J5PSRS2TF · Edit this page on GitHub · Keys: j next, k previous