Difference between revisions of "2011 AIME I Problems/Problem 7"
Tempaccount (talk | contribs) (Remove extra problem section) |
m |
||
Line 30: | Line 30: | ||
So, there is one positive integer solution corresponding to each factor of 2010. Since <math>2010 = 2\cdot 3\cdot 5\cdot 67</math>, the number of solutions is <math>2^4 = \boxed{016}</math>. | So, there is one positive integer solution corresponding to each factor of 2010. Since <math>2010 = 2\cdot 3\cdot 5\cdot 67</math>, the number of solutions is <math>2^4 = \boxed{016}</math>. | ||
+ | |||
+ | ==Solution 4 (for noobs like me)== | ||
+ | The problem is basically asking how many integers <math>m</math> have a power that can be expressed as the sum of 2011 other powers of <math>m</math> (not necessarily distinct). Notice that <math>2+2+4+8+16=32</math>, <math>3+3+3+9+9+27+27+81+81=243</math>, and <math>4+4+4+4+16+16+16+64+64+64+256+256+256=1024</math>. Thus, we can see that the equation <math>2011 = (m-1)x + m</math> must have an integer solution <math>x</math>. To find the number of <math>m</math>-values that allow the aforementioned equation to have an integer solution, we can subtract 1 from the constant <math>m</math> to make the equation equal a friendlier number, <math>2010</math>, instead of the ugly prime number <math>2011</math>: <math>2010 = (m-1)x+(m-1)</math>. Factor the equation and we get <math>2010 = (m-1)(x+1)</math>. The number of values of <math>m-1</math> that allow <math>x+1</math> to be an integer is quite obviously the number of factors of <math>2010</math>. Factoring <math>2010</math>, we obtain <math>2010 = 2 \times 3 \times 5 \times 67</math>, so the number of positive integers <math>m</math> that satisfy the required condition is <math>2^4 = \boxed{016}</math>. | ||
== See also == | == See also == |
Revision as of 21:28, 14 March 2019
Contents
Problem 7
Find the number of positive integers for which there exist nonnegative integers
,
,
,
such that
Solution 1
. Now, divide by
to get
. Notice that since we can choose all nonnegative
, we can make
whatever we desire. WLOG, let
and let
. Notice that, also,
doesn't matter if we are able to make
equal to
for any power of
. Consider
. We can achieve a sum of
by doing
(the simplest" sequence). If we don't have
, to compensate, we need
's. Now, let's try to generalize. The "simplest" sequence is having
times,
times,
. To make other sequences, we can split
s into
s since
. Since we want
terms, we have
. However, since we can set
to be anything we want (including 0), all we care about is that
which happens
times.
Solution 2
Let . The problem then becomes finding the number of positive integer roots
for which
and
are nonnegative integers. We plug in
and see that
. Now, we can say that
for some polynomial
with integer coefficients. Then if
,
. Thus, if
, then
.
Now, we need to show that for all
,
. We try with the first few
that satisfy this.
For
, we see we can satisfy this if
,
,
,
,
,
,
,
, because
(based on the idea
, leading to a chain of substitutions of this kind)
. Thus
is a possible value of
. For other values, for example
, we can use the same strategy, with
,
,
,
,
and
, because
.
It's clearly seen we can use the same strategy for all
. We count all positive
satisfying
, and see there are
Solution 3
One notices that if and only if there exist non-negative integers
such that
.
To prove the forward case, we proceed by directly finding . Suppose
is an integer such that
. We will count how many
, how many
, etc. Suppose the number of
is non-zero. Then, there must be at least
such
since
divides all the remaining terms, so
must also divide the sum of all the
terms. Thus, if we let
for
, we have,
Well clearly,
is greater than
, so
.
will also divide every term,
, where
. So, all the terms,
, where
must sum to a multiple of
. If there are exactly
terms where
, then we must have at least
terms where
. Suppose there are exactly
such terms and
for
. Now, we have,
One can repeat this process for successive powers of
until the number of terms reaches 2011. Since there are
terms after the
th power, we will only hit exactly 2011 terms if
is a factor of 2010. To see this,
Thus, when
(which is an integer since
by assumption, there are exactly 2011 terms. To see that these terms sum to a power of
, we realize that the sum is a geometric series:
Thus, we have found a solution for the case
.
Now, for the reverse case, we use the formula Suppose
has a solution. Subtract 2011 from both sides to get
Now apply the formula to get
where
are some integers. Rearranging this equation, we find
where
. Thus, if
is a solution, then
.
So, there is one positive integer solution corresponding to each factor of 2010. Since , the number of solutions is
.
Solution 4 (for noobs like me)
The problem is basically asking how many integers have a power that can be expressed as the sum of 2011 other powers of
(not necessarily distinct). Notice that
,
, and
. Thus, we can see that the equation
must have an integer solution
. To find the number of
-values that allow the aforementioned equation to have an integer solution, we can subtract 1 from the constant
to make the equation equal a friendlier number,
, instead of the ugly prime number
:
. Factor the equation and we get
. The number of values of
that allow
to be an integer is quite obviously the number of factors of
. Factoring
, we obtain
, so the number of positive integers
that satisfy the required condition is
.
See also
2011 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
- AIME Problems and Solutions
- American Invitational Mathematics Examination
- Mathematics competition resources
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.