Maths Olympiad Prep

Library / /23 of 151

, 2022

Number theory Difficulty 6.0 National Olympiad Prove it Hungary

Sets XZ+X\subset \mathbb{Z}^{+} and YZ+Y\subset \mathbb{Z}^{+} are called comradely, if every positive integer nn can be written as n=xyn=xy for some xXx\in X and yYy\in Y. Let X(n)X(n) and Y(n)Y(n) denote the number of elements of XX and YY, respectively, among the first nn positive integers.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.