olymmath

SCHWEITZER 1964 Problem 1

    Among all possible representations of the positive integer nn as n=∑i=1kain=\sum_{i=1}^k a_i with positive integers k,a1<a2<...<akk, a_1 < a_2 < ...<a_k , when will the product ∏i=1kai\prod_{i=1}^k a_i be maximum?

    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 schweitzer/1964/p1 · Tag FFA487PEK2 · Edit this page on GitHub · Keys: j next, k previous