Difference between revisions of "2010 AMC 10B Problems/Problem 25"
(→Critique of the Critique) |
(→Critique of the (Critique of the Critique)) |
||
Line 35: | Line 35: | ||
You get that from the <math>8\times8</math> matrix <math>M_{i,j} = i^{j-1}</math> and <math>y^T=(315,-315,\ldots,315,-315)</math> and computing <math>c=M^{-1}y</math> which comes out as the all-integer coefficients above. | You get that from the <math>8\times8</math> matrix <math>M_{i,j} = i^{j-1}</math> and <math>y^T=(315,-315,\ldots,315,-315)</math> and computing <math>c=M^{-1}y</math> which comes out as the all-integer coefficients above. | ||
− | == Critique | + | == Critique (cont.)== |
First of all, the solution shows that <math>a</math> is a multiple of <math>315</math>, not a factor of <math>315</math>. Many people confuse the usage of the words 'factor' and 'multiple'. Secondly, even if <math>a</math> is a multiple of <math>315</math>, it does not mean that you can instantly get that the answer is <math>315</math> because we need to know that <math>a=315</math> is possible. After all, <math>a</math> is also a multiple of <math>1</math>, but <math>1</math> is definitely not the smallest possible number. | First of all, the solution shows that <math>a</math> is a multiple of <math>315</math>, not a factor of <math>315</math>. Many people confuse the usage of the words 'factor' and 'multiple'. Secondly, even if <math>a</math> is a multiple of <math>315</math>, it does not mean that you can instantly get that the answer is <math>315</math> because we need to know that <math>a=315</math> is possible. After all, <math>a</math> is also a multiple of <math>1</math>, but <math>1</math> is definitely not the smallest possible number. |
Revision as of 20:08, 24 January 2016
Contents
[hide]Problem
Let , and let
be a polynomial with integer coefficients such that
, and
.
What is the smallest possible value of ?
Solution
We observe that because , if we define a new polynomial
such that
,
has roots when
; namely, when
.
Thus since has roots when
, we can factor the product
out of
to obtain a new polynomial
such that
.
Then, plugging in values of we get
Thus, the least value of
must be the
.
Solving, we receive
, so our answer is
.
Critique
The above solution is incomplete. What is really proven is that 315 is a factor of , if such an
exists. That only rules out answer A.
To prove that the answer is correct, one could exhibit a polynomium that satisfies the requirements with . Here's one:
.
You get that from the matrix
and
and computing
which comes out as the all-integer coefficients above.
Critique (cont.)
First of all, the solution shows that is a multiple of
, not a factor of
. Many people confuse the usage of the words 'factor' and 'multiple'. Secondly, even if
is a multiple of
, it does not mean that you can instantly get that the answer is
because we need to know that
is possible. After all,
is also a multiple of
, but
is definitely not the smallest possible number.
To complete the solution, we can let , and then try to find
. We know from the above calculation that
, and
. Then we can let
, getting
. Let
, then
. Therefore, it is possible to choose
, so the goal is accomplished. As a reference, the polynomial we get is
See also
2010 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last question | |
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 |
Seealso
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.