olymmath

CWMO 2017 Problem 1

    Let pp be a prime and nn be a positive integer such that p2p^2 divides ∏k=1n(k2+1)\prod_{k=1}^n (k^2+1) . Show that p<2np<2n .

    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 cn-wmo/2017/p1 · Tag WRP996ZN8X · Edit this page on GitHub · Keys: j next, k previous