AMC 10 · 2014 · #15

Grade 11 number-theory
logarithm-propertiesexponentsprime-factorizationp-adic-valuation complementary-countingidentify-subproblems ↑ Prerequisites: logarithm-propertiesexponents
📏 Medium solution 💡 3 insights
Problem
A weighted sum of logarithms is exponentiated back into a whole number. Find the largest power of two dividing it.

Pick an answer.

(A)
$2^{12}$
(B)
$2^{14}$
(C)
$2^{16}$
(D)
$2^{18}$
(E)
$2^{20}$
How to solve
Strategy Change Focus / Count the Complement

The expression looks analytic — logarithms, the constant e — but the question asked is pure number theory. So the plan has two focus shifts. First, Tool #15 (Organize Information in More Ways) rewrites the sum of logarithms as a single logarithm of a product, and Tool #11 (Work Backwards) undoes the ln with e; after that no logarithms remain and e^p is an explicit product. Second, Tool #16 (Change Focus): never compute that product. The question only asks how many factors of 2 it holds, so track the exponent of 2 and ignore everything else. Tool #7 (Identify Subproblems) makes that count easy, because the exponent of 2 in a product is the sum of the exponents in the factors, so each k^k can be handled on its own. Finally, "largest" is a maximality claim, not just a divisibility claim, so Tool #14 (Extreme Principle) closes the argument by showing what is left after pulling out 2¹⁶ is odd — which is the part a quick count skips.

1STEP 1

Pull each coefficient inside the log

Each coefficient rises into an exponent.

k ln k = ln k^k → p = ln 1¹ + ln 2² + ln 3³ + ln 4⁴ + ln 5⁵ + ln 6⁶
2STEP 2

Collapse the sum, then undo the log

The sum collapses into one product.

p = ln(1¹ · 2² · 3³ · 4⁴ · 5⁵ · 6⁶) → e^p = 1¹ · 2² · 3³ · 4⁴ · 5⁵ · 6⁶ = N
3STEP 3

Track only the twos

Counting twos is additive across a product.

v₂(xy) = v₂(x) + v₂(y) → v₂(N) = Σ_k=1⁶ v₂ (k^k) = Σ_k=1⁶ k · v₂(k)
4STEP 4

Count the twos base by base

Only three bases contribute any twos.

v₂(1),…,v₂(6) = 0, 1, 0, 2, 0, 1 → v₂(N) = 0 + 2 + 0 + 8 + 0 + 6 = 16
5STEP 5

Prove no seventeenth two exists

What remains is odd, so the answer is 2 to the 16.

N = 2¹⁶ · (1 · 1 · 3³ · 1 · 5⁵ · 3⁶) = 2¹⁶ · 61,509,375, 61,509,375 odd → 2¹⁷ ∤ N
Answer
2¹⁶
The product can be checked directly: 1 · 4 · 27 · 256 · 3125 · 46656 = 4,031,078,400,000. Dividing by 2¹⁶ = 65,536 gives exactly 61,509,375, which ends in 5 and so is odd — confirming both halves of the claim, that 2¹⁶ fits and 2¹⁷ does not. The wrong choices are also readable as specific slips: counting 4⁴ as only four twos gives 2 + 4 + 6 = 12, choice (A); forgetting the 2² term gives 8 + 6 = 14, choice (B). Landing between those two errors is a good sign the count of 16 is the honest one.
💡Key takeaway

A sum of logarithms is a product wearing a disguise; strip the disguise, count how many 2s each factor donates, and then check that what is left over is odd so you know you found every last one.

  • Pull each coefficient inside the log
  • Collapse the sum, then undo the log
  • Track only the twos
  • Count the twos base by base
  • Prove no seventeenth two exists