olymmath

MEMO 2023 T1

    Let ZZ denote the set of all integers and Z>0Z_{>0} denote the set of all positive integers.

    (a) A function f:Z→Zf: Z \rightarrow Z is called ZZ-good if it satisfies f(a2+b)=f(b2+a)f(a^2 + b) = f(b^2 + a) for all a,b∈Za, b \in Z. Determine the largest possible number of distinct values that can occur among f(1),f(2),…,f(2023)f(1), f(2), \ldots, f(2023), where ff is a ZZ-good function.

    (b) A function f:Z>0→Z>0f: Z_{>0} \rightarrow Z_{>0} is called Z>0Z_{>0}-good if it satisfies f(a2+b)=f(b2+a)f(a^2 + b) = f(b^2 + a) for all a,b∈Z>0a, b \in Z_{>0}. Determine the largest possible number of distinct values that can occur among f(1),f(2),…,f(2023)f(1), f(2), \ldots, f(2023), where ff is a Z>0Z_{>0}-good function.

    Official text Middle European Mathematical Olympiad 2023 official paper, page 1. Quoted with source.

    A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

    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 memo/2023/t1 · Tag YZYSBPTFNK · Edit this page on GitHub · Keys: j next, k previous