AMC 10 Step by Step

2022 AMC 10A Problem 19

P16-20~6 minPrint

Define LnL_n as the least common multiple of all the integers from 11 to nn inclusive. There is a unique integer hh such that 11+12+13+⋯+117=hL17\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{17}=\frac{h}{L_{17}} What is the remainder when hh is divided by 1717 ?

Log in to save your progress.
Show solution without answering

Key insight

Multiply through by L17. Then h is L17/1 + L17/2 + ... + L17/17, and every term except the last is a multiple of 17.

Solution

Step 1: build L17L_{17}. The least common multiple of 11 to 1717 takes the highest power of each prime that is at most 1717: 16=2416 = 2^4, 9=329 = 3^2, and 5,7,11,13,175, 7, 11, 13, 17. So
L17=24⋅32⋅5⋅7⋅11⋅13⋅17.L_{17} = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17.

Step 2: find hh. Multiply the equation by L17L_{17}:
h=L171+L172+⋯+L1717.h = \frac{L_{17}}{1} + \frac{L_{17}}{2} + \cdots + \frac{L_{17}}{17}.
Each term is a whole number, because every kk from 11 to 1717 divides L17L_{17}.

Step 3: throw away the terms that are multiples of 17. For k=1,2,…,16k = 1, 2, \ldots, 16, the number kk has no factor of 1717, so dividing L17L_{17} by kk leaves the 1717 in place. Those 1616 terms are all multiples of 1717 and leave remainder 00. Only the last term matters:
L1717=24⋅32⋅5⋅7⋅11⋅13.\frac{L_{17}}{17} = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13.
This one is not a multiple of 1717, because L17L_{17} has only one 1717.

Step 4: find its remainder when divided by 17. Multiply one factor at a time, keeping only the remainder after each step. (This is allowed: the part that is a multiple of 1717 stays a multiple of 1717 after multiplying.)

Multiply byRunning productRemainder after dividing by 17
start16161616
9916×9=144=8×17+816 \times 9 = 144 = 8 \times 17 + 888
558×5=40=2×17+68 \times 5 = 40 = 2 \times 17 + 666
776×7=42=2×17+86 \times 7 = 42 = 2 \times 17 + 888
11118×11=88=5×17+38 \times 11 = 88 = 5 \times 17 + 333
13133×13=39=2×17+53 \times 13 = 39 = 2 \times 17 + 555

So hh leaves remainder 55 when divided by 1717.

The answer is (C) 5\boxed{\textbf{(C)}\ 5}.

Why this works

When fractions are put over a common denominator LL, the numerators are LL divided by each denominator. If a prime appears in LL exactly once, every term except the one that divides it away is still a multiple of that prime. So look for the single term that loses the prime; all the others drop out of the remainder.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Taking the highest power of each prime up to 1717,
L17=24⋅32⋅5⋅7⋅11⋅13⋅17.L_{17} = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17.
Multiplying the equation by L17L_{17} gives
h=L171+L172+⋯+L1717,h = \frac{L_{17}}{1} + \frac{L_{17}}{2} + \cdots + \frac{L_{17}}{17},
and every term is an integer because each k≤17k \le 17 divides L17L_{17}.

Reduce modulo 1717. For k≠17k \ne 17, the factor 1717 of L17L_{17} survives division by kk, so L17k≡0(mod17)\frac{L_{17}}{k} \equiv 0 \pmod{17}. Only the k=17k = 17 term matters:
h≡L1717=24⋅32⋅5⋅7⋅11⋅13(mod17).h \equiv \frac{L_{17}}{17} = 2^4 \cdot 3^2 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \pmod{17}.
Multiply step by step, reducing as we go: 16≡−116 \equiv -1; −1⋅9=−9≡8-1 \cdot 9 = -9 \equiv 8; 8⋅5=40≡68 \cdot 5 = 40 \equiv 6; 6⋅7=42≡86 \cdot 7 = 42 \equiv 8; 8⋅11=88≡38 \cdot 11 = 88 \equiv 3; 3⋅13=39≡53 \cdot 13 = 39 \equiv 5.

So h≡5(mod17)h \equiv 5 \pmod{17}. The answer is (C) 5\boxed{\textbf{(C)}\ 5}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.