Difference between revisions of "2007 AMC 10A Problems/Problem 17"

m (Problem)
(Solution)
Line 5: Line 5:
  
 
== Solution ==
 
== Solution ==
<math>3 \cdot 5^2m</math> must be a perfect cube, so each power of a prime in the factorization for <math>3 \cdot 5^2m</math> must be divisible by <math>3</math>. Thus the minimum value of <math>m</math> is <math>3^2 \cdot 5 = 45</math>, which makes <math>n = \sqrt[3]{3^3 \cdot 5^3} = 15</math>. These sum to <math>60\ \mathrm{(D)}</math>.
+
<math>3 \cdot 5^2m</math> must be a perfect cube, so each power of a prime in the factorization for <math>3 \cdot 5^2m</math> must be divisible by <math>3</math>. Thus the minimum value of <math>m</math> is <math>3^2 \cdot 5 = 45</math>, which makes <math>n = \sqrt[3]{3^3 \cdot 5^3} = 15</math>. The minimum possible value for the sum of <math>m</math> and <math>n</math> is <math>60\ \mathrm{(D)}</math>.
  
 
== See also ==
 
== See also ==

Revision as of 13:40, 3 June 2021

Problem

Suppose that $m$ and $n$ are positive integers such that $75m = n^{3}$. What is a minimum possible value of $m + n$?

$\text{(A)}\ 15 \qquad \text{(B)}\ 30 \qquad \text{(C)}\ 50 \qquad \text{(D)}\ 60 \qquad \text{(E)}\ 5700$

Solution

$3 \cdot 5^2m$ must be a perfect cube, so each power of a prime in the factorization for $3 \cdot 5^2m$ must be divisible by $3$. Thus the minimum value of $m$ is $3^2 \cdot 5 = 45$, which makes $n = \sqrt[3]{3^3 \cdot 5^3} = 15$. The minimum possible value for the sum of $m$ and $n$ is $60\ \mathrm{(D)}$.

See also

2007 AMC 10A (ProblemsAnswer KeyResources)
Preceded by
Problem 16
Followed by
Problem 18
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 10 Problems and Solutions

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