olymmath

RO-TST 2014 Problem 13

    Let nn be a positive integer and let AnA_n respectively BnB_n be the set of nonnegative integers k<nk<n such that the number of distinct prime factors of gcd⁡(n,k)\gcd(n,k) is even (respectively odd). Show that ∣An∣=∣Bn∣|A_n|=|B_n| if nn is even and ∣An∣>∣Bn∣|A_n|>|B_n| if nn is odd.

    Example: A10={0,1,3,7,9}A_{10} = \left\{ 0,1,3,7,9 \right\} , B10={2,4,5,6,8}B_{10} = \left\{ 2,4,5,6,8 \right\} .

    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 ro-tst/2014/p13 · Tag C7EA6Z37SG · Edit this page on GitHub · Keys: j next, k previous