olymmath

SE-SKOLORNAS 2008 Problem 2

    Determine the smallest integer n≥3n \ge 3 with the property that you can choose two of the numbers 1,2,…,n1,2,\dots, n in such a way that their product is equal to the sum of the other n−2n - 2 languages. What are the two numbers?

    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 se-skolornas/2008/p2 · Tag 2ZKPHRJ51S · Edit this page on GitHub · Keys: j next, k previous