Skip to main content

2003 AMC 10B Problem 18

Problem 18 of 25IntermediateNumber Theory

What is the largest integer that is a divisor of (n+1)(n+3)(n+5)(n+7)(n+9) \begin{aligned} &(n+1)(n+3)(n+5) \\ &\quad {}\cdot (n+7)(n+9) \end{aligned} for all positive even integers n?n?

Answer choices

Show solution

Solution

When nn is even, the factors are five consecutive odd numbers. Among any five consecutive odd numbers, at least one is divisible by 33 and exactly one by 5,5, so the product is always divisible by 15.15. To prove that no larger fixed divisor is forced, compare three cases: n=2:357911,n=10:1113151719,n=12:1315171921. \begin{aligned} n=2 &: 3\cdot5\cdot7\cdot9\cdot11,\\ n=10 &: 11\cdot13\cdot15\cdot17\cdot19,\\ n=12 &: 13\cdot15\cdot17\cdot19\cdot21. \end{aligned} The greatest common divisor of these three products is exactly 15,15, so a divisor common to every case cannot be any larger. Thus, the correct answer is D.

More practice

Concepts: divisibility · greatest common divisor

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