Difference between revisions of "2013 AMC 12B Problems/Problem 25"
(→See also) |
Armalite46 (talk | contribs) m (→Solution) |
||
Line 12: | Line 12: | ||
We do casework on the (unique) even constant term <math>d\in\{\pm2,\pm10,\pm50\}</math> in our product. For convenience, let <math>F(d)</math> be the number of ways to get a product of <math>50/d</math> without using <math>\pm 1</math> (so only using <math>\pm5,\pm25</math>) and recall <math>f(-1) = 1</math>; then our final answer will be <math>2^{f(1)}\sum_{d\in\{2,10,50\}}(f(-d)+f(d))(F(-d)+F(d))</math>. It's easy to compute <math>F(-50)=0</math>, <math>F(50)=1</math>, <math>F(-10)=f(5)=5</math>, <math>F(10)=f(-5)=1</math>, <math>F(-2)=f(-25)+f(-5)f(5)=6</math>, <math>F(2)=f(25)+\binom{f(5)}{2}=16</math>, so we get | We do casework on the (unique) even constant term <math>d\in\{\pm2,\pm10,\pm50\}</math> in our product. For convenience, let <math>F(d)</math> be the number of ways to get a product of <math>50/d</math> without using <math>\pm 1</math> (so only using <math>\pm5,\pm25</math>) and recall <math>f(-1) = 1</math>; then our final answer will be <math>2^{f(1)}\sum_{d\in\{2,10,50\}}(f(-d)+f(d))(F(-d)+F(d))</math>. It's easy to compute <math>F(-50)=0</math>, <math>F(50)=1</math>, <math>F(-10)=f(5)=5</math>, <math>F(10)=f(-5)=1</math>, <math>F(-2)=f(-25)+f(-5)f(5)=6</math>, <math>F(2)=f(25)+\binom{f(5)}{2}=16</math>, so we get | ||
− | <cmath> 4 [ (1+3)(6+16) + (1+5)(1+5) + (1+7)(0+1) ] = 4[132] = 528 | + | <cmath> 4 [ (1+3)(6+16) + (1+5)(1+5) + (1+7)(0+1) ] = 4[132] = \boxed{\textbf{(B) }528} </cmath> |
== See also == | == See also == |
Revision as of 20:31, 7 November 2013
Problem
Let be the set of polynomials of the form
where
are integers and
has distinct roots of the form
with
and
integers. How many polynomials are in
?
$\textbf{(A)}\ 288\qquad\textbf{(B)}\ 528\qquad\textbf{(C)}\ 576\qquad\textbf{(D}}\ 992\qquad\textbf{(E)}\ 1056$ (Error compiling LaTeX. Unknown error_msg)
Solution
If we factor into irreducible polynomials (in ), each factor
has exponent
in the factorization and degree at most
(since the
with
come in conjugate pairs with product
). Clearly we want the product of constant terms of these polynomials to equal
; for
, let
be the number of permitted
with constant term
. It's easy to compute
,
,
,
,
,
, and obviously
for negative
.
Note that by the distinctness condition, the only constant terms that can be repeated are those with
and
, i.e.
and
. Also, the
s don't affect the product, so we can simply count the number of polynomials with no constant terms of
and multiply by
at the end.
We do casework on the (unique) even constant term in our product. For convenience, let
be the number of ways to get a product of
without using
(so only using
) and recall
; then our final answer will be
. It's easy to compute
,
,
,
,
,
, so we get
See also
2013 AMC 12B (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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.