olymmath

EGMO 2025 Problem 1

  • Day 1
  • Answer

For a positive integer NN , let c1<c2<⋯<cmc_{1}< c_{2}< \dots < c_{m} be all the positive integers smaller than NN that are coprime to NN . Find all N≥3N\geq 3 such that

gcd⁡(N,ci+ci+1)≠1\gcd (N,c_{i} + c_{i + 1})\neq 1

for all 1≤i≤m−11\leq i\leq m - 1

Here gcd⁡(a,b)\gcd (a,b) is the largest positive integer that divides both aa and bb . Integers aa and bb are coprime if gcd⁡(a,b)=1\gcd (a,b) = 1 .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

N \text{ is a power of 3}

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

Locator egmo/2025/p1 · Tag 6KT1CMSA6P · Edit this page on GitHub · Keys: j next, k previous