Define as the least common multiple of all the integers from to inclusive. There is a unique integer such that What is the remainder when is divided by ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
h is the sum of L_17/k; every term except k = 17 keeps the factor 17, so h is congruent to L_17/17 = lcm(1..16) mod 17, which is 5.
Solution
Taking the highest power of each prime up to ,
Multiplying the equation by gives
and every term is an integer because each divides .
Reduce modulo . For , the factor of survives division by , so . Only the term matters:
Multiply step by step, reducing as we go: ; ; ; ; ; .
So . The answer is .
Why this works
When a sum of fractions is put over a common denominator , each numerator is . Modulo a prime that divides exactly once, every with is still a multiple of , and only the term survives. Look for the one term that loses the prime; everything else vanishes.
The trap
Trying to compute the harmonic sum or L_17 exactly, or forgetting that 17 divides L_17 only once (so L_17/17 is not a multiple of 17).
Common mistakes
- Trying to compute the harmonic sum or L_17 exactly, or forgetting that 17 divides L_17 only once (so L_17/17 is not a multiple of 17).
- Arithmetic slips in the mod product; reduce after every multiplication and use to keep numbers small.
Techniques
Set up the equation/formula and compute; no special trick needed