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"

(→‎Problem)
(→‎Solution)
Line 5: Line 5:
  
 
== Solution ==
 
== Solution ==
−
 
−
Suppose <math>n = 100\cdot q + r = 99\cdot q + (q+r)</math>
 
−
 
−
Since <math>11|(q+r)</math> and <math>11|99q</math>, <math>11|n</math>
 
−
 
−
<math>10000 \leq n \leq 99999</math>, so there are <math>\left\lfloor\frac{99999}{11}\right\rfloor-\left\lceil\frac{10000}{11}\right\rceil+1 = \boxed{8181}</math> values of <math>q+r</math> that are divisible by <math>11 \Rightarrow {B}</math>.
 
  
 
== See Also==
 
== See Also==
 
{{AMC12 box|year=2003|ab=B|num-b=17|num-a=19}}
 
{{AMC12 box|year=2003|ab=B|num-b=17|num-a=19}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 03: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

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=62244"