olymmath

AUSTRIAN-POLISH 1986 Problem 7

    Let kk and nn be integers with 0<k<n2/40 < k < n^2/4 such that k has no prime divisor greater than nn . Prove that kk divides n!n! .

    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 austrian-polish/1986/p7 · Tag QK562R59QG · Edit this page on GitHub · Keys: j next, k previous