2003 AMC 12B Problem 18

Below is the professionally curated solution for Problem 18 of the 2003 AMC 12B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2003 AMC 12B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:prime factorizationmodular arithmetic

Difficulty rating: 1710

18.

Let xx and yy be positive integers such that 7x5=11y13.7x^5 = 11y^{13}. The minimum possible value of xx has a prime factorization acbd.a^c b^d. What is a+b+c+d?a + b + c + d?

3030

3131

3232

3333

3434

Solution:

For the minimum x,x, neither xx nor yy has prime factors other than 77 and 11.11. Write x=7c11d,x = 7^c 11^d, so 7x5=75c+1115d.7x^5 = 7^{5c+1} 11^{5d}. Writing y=7m11n,y = 7^m 11^n, we need 75c+1115d=713m1113n+1.7^{5c+1}11^{5d} = 7^{13m}11^{13n+1}.

Matching exponents: 5c+10(mod13)5c + 1 \equiv 0 \pmod{13} gives the least c=5,c = 5, and 5d1(mod13)5d \equiv 1 \pmod{13} gives the least d=8.d = 8. So a=7,a = 7, b=11,b = 11, and a+b+c+d=7+11+5+8=31. a + b + c + d = 7 + 11 + 5 + 8 = 31.

Thus, the correct answer is B.

Problem 18 in Other Years