olymmath

KMO 2016 Problem 7

    Let N=2ap1b1p2b2…pkbkN=2^a p_1^{b_1} p_2^{b_2} \ldots p_k^{b_k} . Prove that there are (b1+1)(b2+1)…(bk+1)(b_1+1)(b_2+1)\ldots(b_k+1) number of nn s which satisfies these two conditions. n(n+1)2≤N\frac{n(n+1)}{2}\le N , N−n(n+1)2N-\frac{n(n+1)}{2} is divided by nn .

    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 kr-kmo/2016/p7 · Tag W2E20N9WSH · Edit this page on GitHub · Keys: j next, k previous