Difference between revisions of "2003 AMC 12B Problems/Problem 18"

(Solution)
m (latex errors)
Line 8: Line 8:
 
Substitute <math>a^cb^d</math> into <math>x</math>. We then have <math>7(a^{5c}b^{5d}) = 11y^{13}</math>. Divide both sides by <math>7</math>, and it follows that:
 
Substitute <math>a^cb^d</math> into <math>x</math>. We then have <math>7(a^{5c}b^{5d}) = 11y^{13}</math>. Divide both sides by <math>7</math>, and it follows that:
  
<cmath>(a^{5c}b^{5d}) = \[\frac{11y^{13}}{7}.</cmath>
+
<cmath>(a^{5c}b^{5d}) = \frac{11y^{13}}{7}.</cmath>
  
 
Note that because <math>11</math> and <math>7</math> are prime, the minimum value of <math>x</math> must involve factors of <math>7</math> and <math>11</math> only. Thus, we try to look for the lowest power <math>p</math> of <math>11</math> such that <math>13p + 1 \equiv 0 \pmod{5}</math>, so that we can take <math>11^{13p + 1}</math> to the fifth root. Similarly, we want to look for the lowest power <math>n</math> of <math>7</math> such that <math>13n - 1 \equiv 0 \pmod{5}</math>. Again, this allows us to take the fifth root of <math>7^{13n - 1}</math>. Obviously, we want to add <math>1</math> to <math>13p</math> and subtract <math>1</math> from <math>13n</math> because <math>11^{13p}</math> and <math>7^{13n}</math> are multiplied by <math>11</math> and divided by <math>7</math>, respectively. With these conditions satisfied, we can simply multiply <math>11^{p}</math> and <math>7^{n}</math> and substitute this quantity into <math>y</math> to attain our answer.
 
Note that because <math>11</math> and <math>7</math> are prime, the minimum value of <math>x</math> must involve factors of <math>7</math> and <math>11</math> only. Thus, we try to look for the lowest power <math>p</math> of <math>11</math> such that <math>13p + 1 \equiv 0 \pmod{5}</math>, so that we can take <math>11^{13p + 1}</math> to the fifth root. Similarly, we want to look for the lowest power <math>n</math> of <math>7</math> such that <math>13n - 1 \equiv 0 \pmod{5}</math>. Again, this allows us to take the fifth root of <math>7^{13n - 1}</math>. Obviously, we want to add <math>1</math> to <math>13p</math> and subtract <math>1</math> from <math>13n</math> because <math>11^{13p}</math> and <math>7^{13n}</math> are multiplied by <math>11</math> and divided by <math>7</math>, respectively. With these conditions satisfied, we can simply multiply <math>11^{p}</math> and <math>7^{n}</math> and substitute this quantity into <math>y</math> to attain our answer.
Line 15: Line 15:
 
We can simply look for suitable values for <math>p</math> and <math>n</math>. We find that the lowest <math>p</math>, in this case, would be <math>3</math> because <math>13(3) + 1 \equiv 0 \pmod{5}</math>. Moreover, the lowest <math>q</math> should be <math>2</math> because <math>13(2) - 1 \equiv 0 \pmod{5}</math>. Hence, we can substitute the quantity <math>11^{3} \cdot 7^{2}</math> into <math>y</math>. Doing so gets us:
 
We can simply look for suitable values for <math>p</math> and <math>n</math>. We find that the lowest <math>p</math>, in this case, would be <math>3</math> because <math>13(3) + 1 \equiv 0 \pmod{5}</math>. Moreover, the lowest <math>q</math> should be <math>2</math> because <math>13(2) - 1 \equiv 0 \pmod{5}</math>. Hence, we can substitute the quantity <math>11^{3} \cdot 7^{2}</math> into <math>y</math>. Doing so gets us:
  
<cmath>(a^{5c}b^{5d}) = \[\frac{11(11^{3} \cdot 7^{2})^{13}}{7} = 11^{40} \cdot 7^{25}.</cmath>
+
<cmath>(a^{5c}b^{5d}) = \frac{11(11^{3} \cdot 7^{2})^{13}}{7} = 11^{40} \cdot 7^{25}.</cmath>
  
 
Taking the fifth root of both sides, we are left with <math>a^cb^d = 11^{8} \cdot 7^{5}</math>. <math>a + b + c + d = 11 + 7 + 8 + 5 = \boxed{\textbf{(B)}\ 31}</math>
 
Taking the fifth root of both sides, we are left with <math>a^cb^d = 11^{8} \cdot 7^{5}</math>. <math>a + b + c + d = 11 + 7 + 8 + 5 = \boxed{\textbf{(B)}\ 31}</math>

Revision as of 23:51, 24 June 2015

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

Substitute $a^cb^d$ into $x$. We then have $7(a^{5c}b^{5d}) = 11y^{13}$. Divide both sides by $7$, and it follows that:

\[(a^{5c}b^{5d}) = \frac{11y^{13}}{7}.\]

Note that because $11$ and $7$ are prime, the minimum value of $x$ must involve factors of $7$ and $11$ only. Thus, we try to look for the lowest power $p$ of $11$ such that $13p + 1 \equiv 0 \pmod{5}$, so that we can take $11^{13p + 1}$ to the fifth root. Similarly, we want to look for the lowest power $n$ of $7$ such that $13n - 1 \equiv 0 \pmod{5}$. Again, this allows us to take the fifth root of $7^{13n - 1}$. Obviously, we want to add $1$ to $13p$ and subtract $1$ from $13n$ because $11^{13p}$ and $7^{13n}$ are multiplied by $11$ and divided by $7$, respectively. With these conditions satisfied, we can simply multiply $11^{p}$ and $7^{n}$ and substitute this quantity into $y$ to attain our answer.


We can simply look for suitable values for $p$ and $n$. We find that the lowest $p$, in this case, would be $3$ because $13(3) + 1 \equiv 0 \pmod{5}$. Moreover, the lowest $q$ should be $2$ because $13(2) - 1 \equiv 0 \pmod{5}$. Hence, we can substitute the quantity $11^{3} \cdot 7^{2}$ into $y$. Doing so gets us:

\[(a^{5c}b^{5d}) = \frac{11(11^{3} \cdot 7^{2})^{13}}{7} = 11^{40} \cdot 7^{25}.\]

Taking the fifth root of both sides, we are left with $a^cb^d = 11^{8} \cdot 7^{5}$. $a + b + c + d = 11 + 7 + 8 + 5 = \boxed{\textbf{(B)}\ 31}$

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