olymmath

CN-TST 2023 Problem 7

    Given the integer n≥2n\geq 2 and a integer a{a} , which is coprime with n{n} . A country has n{n} islands D1D_1 , D2D_2 , ⋯\cdots , DnD_n . For any 1≤i≠j≤n1\leq i\neq j\leq n , there is a one-way ferry DiD_i to DjD_j if and only if ij≡ia(modn)ij\equiv ia\pmod n . A tourist can initially fly to any of the islands, and then he can only take a one-way ferry. What is the maximum number of islands he can visit?

    Created by Zhenhua Qu

    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-tst/2023/p7 · Tag Q9DJ44N4NP · Edit this page on GitHub · Keys: j next, k previous