Maths Olympiad Prep

Library / /34 of 151

, 2020

Number theory Difficulty 6.0 National Olympiad Prove it Hungary

Let kt2k\ge t\ge 2 positive integers. For integers nkn\ge k let pnp_n be the probability that if we choose kk from the first nn positive integers randomly, any tt of the kk chosen integers have greatest common divisor 1. Let qnq_n be the probability that if we choose kt+1k-t+1 from the first nn positive integers the product is not divisible by a perfect tt-th power that is greater then 1.

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.