olymmath

ILL 1969 Problem 48

    (NET3)(NET 3) Let x1,x2,x3,x4,x_1, x_2, x_3, x_4, and x5x_5 be positive integers satisfying x1+x2+x3+x4+x5=1000,x_1 +x_2 +x_3 +x_4 +x_5 = 1000,

    x1−x2+x3−x4+x5>0,x_1 -x_2 +x_3 -x_4 +x_5 > 0,

    x1+x2−x3+x4−x5>0,x_1 +x_2 -x_3 +x_4 -x_5 > 0,

    −x1+x2+x3−x4+x5>0,-x_1 +x_2 +x_3 -x_4 +x_5 > 0,

    x1−x2+x3+x4−x5>0,x_1 -x_2 +x_3 +x_4 -x_5 > 0,

    −x1+x2−x3+x4+x5>0-x_1 +x_2 -x_3 +x_4 +x_5 > 0

    (a)(a) Find the maximum of (x1+x3)x2+x4(x_1 + x_3)^{x_2+x_4} (b)(b) In how many different ways can we choose x1,...,x5x_1, . . . , x_5 to obtain the desired maximum?

    Dataset text AoPS wiki problems. 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 ill/1969/p48 · Tag DHD0Z91VVZ · Edit this page on GitHub · Keys: j next, k previous