olymmath

CAPS 2015 Problem 6

    Let nn be even positive integer. There are nn real positive numbers written on the blackboard. In every step, we choose two numbers, erase them, and replace each of then by their product. Show that for any initial nn -tuple it is possible to obtain nn equal numbers on the blackboard after a finite number of steps.

    Proposed by Peter Novotný

    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 caps/2015/p6 · Tag PQZVKMEMJJ · Edit this page on GitHub · Keys: j next, k previous