olymmath

OSN 2022 Problem 5

    Let N≥2N\ge2 be a positive integer. Given a sequence of natural numbers a1,a2,a3,…,aN+1a_1,a_2,a_3,\dots,a_{N+1} such that for every integer 1≤i≤j≤N+11\le i\le j\le N+1 , aiai+1ai+2…aj≢1mod  Na_ia_{i+1}a_{i+2}\dots a_j \not\equiv1\mod{N} Prove that there exist a positive integer k≤N+1k\le N+1 such that gcd⁡(ak,N)≠1\gcd(a_k, N) \neq 1

    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 id-osn/2022/p5 · Tag 5G9WBMK1MX · Edit this page on GitHub · Keys: j next, k previous