2003 AMC 12B Problems/Problem 18

Revision as of 04:52, 9 June 2014 by Hnkevin42 (talk | contribs) (Problem)

Problem

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

$\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$

Solution

Suppose $n = 100\cdot q + r = 99\cdot q + (q+r)$

Since $11|(q+r)$ and $11|99q$, $11|n$

$10000 \leq n \leq 99999$, so there are $\left\lfloor\frac{99999}{11}\right\rfloor-\left\lceil\frac{10000}{11}\right\rceil+1 = \boxed{8181}$ values of $q+r$ that are divisible by $11 \Rightarrow {B}$.

See Also

2003 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 17
Followed by
Problem 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png