2007 AMC 10A Problems/Problem 17: Difference between revisions
| (9 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
Suppose that <math>m</math> and <math>n</math> are positive [[integer]]s such that <math>75m = n^{3}</math>. What is | Suppose that <math>m</math> and <math>n</math> are positive [[integer]]s such that <math>75m = n^{3}</math>. What is the minimum possible value of <math>m + n</math>? | ||
<math>\text{(A)}\ 15 \qquad \text{(B)}\ 30 \qquad \text{(C)}\ 50 \qquad \text{(D)}\ 60 \qquad \text{(E)}\ 5700</math> | <math>\text{(A)}\ 15 \qquad \text{(B)}\ 30 \qquad \text{(C)}\ 50 \qquad \text{(D)}\ 60 \qquad \text{(E)}\ 5700</math> | ||
== 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>. The minimum possible value for the sum of <math>m</math> and <math>n</math> is <math>60\ \ | <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>\boxed {(D)60}.</math> | ||
==Solution 2== | |||
First, we need to prime factorize <math>75</math>. <math>75</math> = <math>5^2 \cdot 3</math>. We need <math>75m</math> to be in the form <math>x^3y^3</math>. Therefore, the smallest <math>m</math> is <math>5 \cdot 3^2</math>. <math>m</math> = 45, and since <math>5^3 \cdot 3^3 = 15^3</math>, our answer is <math>45 + 15</math> = <math>\boxed {(D)60}</math> | |||
~Arcticturn | |||
== See also == | == See also == | ||
Latest revision as of 09:51, 4 February 2025
Problem
Suppose that
and
are positive integers such that
. What is the minimum possible value of
?
Solution
must be a perfect cube, so each power of a prime in the factorization for
must be divisible by
. Thus the minimum value of
is
, which makes
. The minimum possible value for the sum of
and
is
Solution 2
First, we need to prime factorize
.
=
. We need
to be in the form
. Therefore, the smallest
is
.
= 45, and since
, our answer is
=
~Arcticturn
See also
| 2007 AMC 10A (Problems • Answer Key • Resources) | ||
| 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 | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing