Maths Olympiad Prep

Library / /161 of 353

Number theory Difficulty 4.9 AIME Find the answer

An integer nn is chosen uniformly at random from the set {1,2,3,,2023!}\{1,2,3, \ldots, 2023!\}. Compute the probability that gcd(nn+50,n+1)=1\operatorname{gcd}\left(n^{n}+50, n+1\right)=1

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

If nn is even, we need gcd(n+1,51)=1\operatorname{gcd}(n+1,51)=1. If nn is odd, we need gcd(n+1,49)=1\operatorname{gcd}(n+1,49)=1. Thus, the answer is 12(φ(49)49+φ(51)51)=265357\frac{1}{2}\left(\frac{\varphi(49)}{49}+\frac{\varphi(51)}{51}\right)=\frac{265}{357}

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: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.