Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

(→‎Solution)
(→‎Solution)
Line 10: Line 10:
 
<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 5th 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.
  
  

Revision as of 04:52, 9 June 2014

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}. (Error compiling LaTeX. Unknown error_msg)

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}. (Error compiling LaTeX. Unknown error_msg)

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 (Problems • Answer Key • Resources)
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2003_AMC_12B_Problems/Problem_18&oldid=62247"