olymmath

SMO 2014 Problem 5

    Determine the largest odd positive integer nn such that every odd integer kk with 1<k<n1<k<n and gcd⁡(k,n)=1\gcd(k, n)=1 is a prime.

    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 sg-smo/2014/p5 · Tag GWKZHTHMZA · Edit this page on GitHub · Keys: j next, k previous