olymmath

NL-NWO 1998 Problem 1

    Consider any permutation σ\sigma of {0,1,2,…,9}\{0,1,2,\dots,9\} and for each of the 8 triples of consecutive numbers in this permutation, consider the sum of these three numbers. Let M(σ)M(\sigma) be the largest of these 8 sums. (For example, for the permutation σ=(4,6,2,9,0,1,8,5,7,3)\sigma = (4, 6, 2, 9, 0, 1, 8, 5, 7, 3) we get the 8 sums 12, 17, 11, 10, 9, 14, 20, 15, and M(σ)=20M(\sigma) = 20 .)

    (a) Find a permutation σ1\sigma_1 such that M(σ1)=13M(\sigma_1) = 13 .

    (b) Does there exist a permutation σ2\sigma_2 such that M(σ2)=12M(\sigma_2) = 12 ?

    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 nl-nwo/1998/p1 · Tag XJGXDPVBKW · Edit this page on GitHub · Keys: j next, k previous