AMC 10 · 2003 · #18

Grade 8 number-theory
prime-factorizationexponentsmodular-arithmetic identify-subproblemsextreme-principle ↑ Prerequisites: prime-factorization
📏 Long solution 💡 3 insights
Problem
Positive integers x and y satisfy 7x⁵ = 11y¹³. Among all such pairs, take the one with the smallest possible x, whose prime factorization has the form a^cb^d. Find a+b+c+d.

Pick an answer.

(A)
30
(B)
31
(C)
32
(D)
33
(E)
34
How to solve
Strategy Introduce a Variable

The numbers here are far too big to write out, but only their prime exponents matter, so Tool #4 (Introduce a Variable) names those exponents: let c be how many 7s are in x and d how many 11s. Tool #7 (Identify Subproblems) then splits one huge equation into one small equation per prime, because unique factorization forces the exponents to match prime by prime. Tool #14 (Extreme Principle) is what the word "minimum" is asking for: each exponent has a smallest legal value, and pushing every one of them down as far as it can go is exactly how x is made smallest. Tool #6 (Guess and Check) finishes each small equation — 5c+1=13m has so few candidates that walking m=1,2,3,… settles it in seconds.

1STEP 1

Compare one prime at a time

Unique factorization lets each prime be matched separately, splitting one equation into many small ones.

7x⁵=11y¹³ ⟹ (exponent of p on the left) = (exponent of p on the right) for every prime p
2STEP 2

Primes other than 7 and 11 cost too much

Any other prime would need a huge exponent, so the smallest x uses only the two named primes.

5e = 13f → 13 ∣ e → e ∈ {0, 13, 26, …} → e = 0
3STEP 3

Write both sides in exponent form

Writing both sides as powers and matching gives two congruences.

7x⁵ = 7⁵c+111⁵d, 11y¹³ = 7¹3m11¹³ⁿ⁺¹ ⟹ 5c+1 = 13m and 5d = 13n+1
4STEP 4

Smallest c with 5c+1 a multiple of 13

Walking upward, the smallest exponent of the first prime is 5.

m=1: 5c=12 (no) m=2: 5c=25 → c=5 (yes)
5STEP 5

Smallest d with 5d-1 a multiple of 13

The same walk gives the second exponent as 8.

n=0: 5d=1 (no) n=1: 5d=14 (no) n=2: 5d=27 (no) n=3: 5d=40 → d=8
6STEP 6

Confirm the minimum, then add

Exhibiting a matching partner confirms it, and the four numbers add to 31, choice (B).

x_min = 7⁵ · 11⁸, y = 7² · 11³, a+b+c+d = 7+11+5+8 = 31 → (B)
Answer
31
The candidate pair can be checked directly in the original equation: 7x⁵ = 7 · 7²⁵11⁴⁰ = 7²⁶11⁴⁰ and 11y¹³ = 11 · 7²⁶11³⁹ = 7²⁶11⁴⁰, so the two sides match exactly. It is also worth noticing that the answer does not depend on labelling: whether (a,c)=(7,5) and (b,d)=(11,8) or the other way round, the sum 7+11+5+8 is the same 31. The five choices are 30 through 34, all within one of each other, so guessing is useless and each exponent has to be right: dropping c to 4 or d to 7 would break divisibility by 13, and raising either by one would make x larger without fixing anything.
💡Key takeaway

When two products of primes are equal, count one prime at a time; the smallest number is the one where every exponent is pushed down to its lowest legal value.

  • Compare one prime at a time
  • Primes other than 7 and 11 cost too much
  • Write both sides in exponent form
  • Smallest c with 5c+1 a multiple of 13
  • Smallest d with 5d-1 a multiple of 13
  • Confirm the minimum, then add