Skip to main content

2022 AMC 10A Problem 19

Problem 19 of 25HarderNumber Theory

Let LnL_n denote the least common multiple of the numbers 1,1, 2,2, 3,3, ,\ldots, n,n, and let hh be the unique positive integer such that 11+12+13++117=hL17\dfrac{1}{1} + \dfrac{1}{2} + \dfrac{1}{3} + \cdots + \dfrac{1}{17} = \dfrac{h}{L_{17}} What is the remainder when hh is divided by 17?17?

Answer choices

Show solution

Solution

Multiplying the harmonic sum by L17,L_{17}, we get h=i=117L17i.h=\sum_{i=1}^{17}\frac{L_{17}}{i}. For 1i16,1\le i\le16, the term L17i\frac{L_{17}}{i} is still divisible by 17,17, so these terms contribute 0(mod17).0\pmod{17}. Thus hL1717(mod17).h\equiv \frac{L_{17}}{17}\pmod{17}. The least common multiple L17L_{17} contains the prime-power factors 16,9,5,7,11,13,17,16,9,5,7,11,13,17, so L1717169571113(mod17). \begin{aligned} \frac{L_{17}}{17} &\equiv 16\cdot9\cdot5\cdot7\cdot11\cdot13 \\ &\pmod{17}. \end{aligned} Reducing modulo 17,17, this is (1)9571113(-1)\cdot9\cdot5\cdot7\cdot11\cdot13 5(mod17).\equiv5\pmod{17}. Thus, C is the correct answer.

More practice

Concepts: modular arithmetic · least common multiple · prime factorization

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.