olymmath

XK-TST 2022 Problem 4

    On a board, Ana writes aa different integers, while Ben writes bb different integers. Then, Ana adds each of her numbers with with each of Ben's numbers and she obtains cc different integers. On the other hand, Ben substracts each of his numbers from each of Ana's numbers and he gets dd different integers.

    For each integer nn , let f(n)f(n) be the number of ways that nn may be written as sum of one number of Ana and one number of Ben.

    a) Show that there exist an integer nn such that, f(n)≥abc.f(n)\geq\frac{ab}{c}. b) Does there exist an integer nn such that, f(n)≥abd?f(n)\geq\frac{ab}{d}? Proposed by Besfort Shala, Kosovo

    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 xk-tst/2022/p4 · Tag 479M0JQVQ0 · Edit this page on GitHub · Keys: j next, k previous