olymmath

KöMaL 2025 B5436

    Let pp be an odd prime. Let dk(n)d_k(n) denote the number of positive divisors of nn with remainder kk modulo pp (0≤k<p0\leq k<p). Let A⊆{0,1,…,p−1}=SA\subseteq\{0,1,\dots,p-1\}=S satisfy ∑k∈Adk(n)≥∑j∈S∖Adj(n)\sum_{k\in A}d_k(n)\geq\sum_{j\in S\setminus A}d_j(n) for every positive integer nn. Find the minimum number of elements of AA.

    Official text KöMaL. 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 hu-komal/2025/b5436 · Tag 2V12B5M3WX · Edit this page on GitHub · Keys: j next, k previous