Difference between revisions of "2020 AMC 10A Problems/Problem 17"
(Created page with "Define<cmath>P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).</cmath>How many integers <math>n</math> are there such that <math>P(n)\leq 0</math>? <math>\textbf{(A) } 4900 \qquad \textbf...") |
MRENTHUSIASM (talk | contribs) (→Solution Visual Aid) |
||
(146 intermediate revisions by 26 users not shown) | |||
Line 1: | Line 1: | ||
− | Define<cmath>P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).</cmath>How many integers <math>n</math> are there such that <math>P(n)\leq 0</math>? | + | == Problem == |
+ | |||
+ | Define <cmath>P(x) =(x-1^2)(x-2^2)\cdots(x-100^2).</cmath> How many integers <math>n</math> are there such that <math>P(n)\leq 0</math>? | ||
<math>\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100</math> | <math>\textbf{(A) } 4900 \qquad \textbf{(B) } 4950\qquad \textbf{(C) } 5000\qquad \textbf{(D) } 5050 \qquad \textbf{(E) } 5100</math> | ||
+ | |||
+ | == Solution Visual Aid == | ||
+ | Visualization that makes it easier to see solutions: | ||
+ | |||
+ | <asy> | ||
+ | size(600); | ||
+ | |||
+ | // Draw the main number line (x-axis) | ||
+ | draw((-5, 0) -- (5, 0), Arrow); // Line from -10 to 10 with an arrow at the end | ||
+ | draw((5, 0) -- (-5, 0), Arrow); // Line from -10 to 10 with an arrow at the end | ||
+ | |||
+ | // Add ticks and labels at each integer point from -10 to 10 | ||
+ | for (int i = -4; i <= 4; ++i) { | ||
+ | if (i != 0) | ||
+ | draw((i, -0.1) -- (i, 0.1)); // Tick mark | ||
+ | // label(string(i), (i, -0.5), S); // Label each tick below the line | ||
+ | } | ||
+ | |||
+ | label("$1^2$", (-4, -0.5), S); // Label each tick below the line | ||
+ | label("$2^2$", (-3, -0.5), S); // Label each tick below the line | ||
+ | label("$3^2$", (-2, -0.5), S); // Label each tick below the line | ||
+ | label("$4^2$", (-1, -0.5), S); // Label each tick below the line | ||
+ | label("\dots", (0, -0.5), S); // Label each tick below the line | ||
+ | label("$97^2$", (1, -0.5), S); // Label each tick below the line | ||
+ | label("$98^2$", (2, -0.5), S); // Label each tick below the line | ||
+ | label("$99^2$", (3, -0.5), S); // Label each tick below the line | ||
+ | label("$100^2$", (4, -0.5), S); // Label each tick below the line | ||
+ | |||
+ | label("$0$", (-4, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (-3, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (-2, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (-1, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (1, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (2, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (3, 0.1), N); // Label each tick below the line | ||
+ | label("$0$", (4, 0.1), N); // Label each tick below the line | ||
+ | |||
+ | label("$+$", (-4.5, 0), N); // Label each tick below the line | ||
+ | label("$-$", (-3.5, 0), N); // Label each tick below the line | ||
+ | label("$+$", (-2.5, 0), N); // Label each tick below the line | ||
+ | label("$-$", (-1.5, 0), N); // Label each tick below the line | ||
+ | |||
+ | label("$+$", (4.5, 0), N); // Label each tick below the line | ||
+ | label("$-$", (3.5, 0), N); // Label each tick below the line | ||
+ | label("$+$", (2.5, 0), N); // Label each tick below the line | ||
+ | label("$-$", (1.5, 0), N); // Label each tick below the line | ||
+ | </asy> | ||
+ | |||
+ | === Note === | ||
+ | Clearly, there are a finite amount of integers that result in <math>P(x)</math> being nonpositive. This is because there are an even number of factors of <math>P(x).</math> From here, you can read other solutions that count the amount of negative numbers of <math>P(x).</math> ~jasmineLOVER7254 | ||
+ | |||
+ | == Solution 1 (Casework) == | ||
+ | We perform casework on <math>P(n)\leq0:</math> | ||
+ | <ol style="margin-left: 1.5em;"> | ||
+ | <li><math>P(n)=0</math></li><p> | ||
+ | In this case, there are <math>100</math> such integers <math>n:</math> <cmath>1^2,2^2,3^2,\ldots,100^2.</cmath> | ||
+ | <li><math>P(n)<0</math></li><p> | ||
+ | There are <math>100</math> factors in <math>P(x),</math> and we need an odd number of them to be negative. We construct the table below: | ||
+ | <cmath>\begin{array}{c|c|c} | ||
+ | & & \\ [-2.5ex] | ||
+ | \textbf{Interval of }\boldsymbol{x} & \boldsymbol{\#}\textbf{ of Negative Factors} & \textbf{Valid?} \\ [0.5ex] | ||
+ | \hline | ||
+ | & & \\ [-2ex] | ||
+ | \left(-\infty,1^2\right) & 100 & \\ [0.5ex] | ||
+ | \left(1^2,2^2\right) & 99 & \checkmark \\ [0.5ex] | ||
+ | \left(2^2,3^2\right) & 98 & \\ [0.5ex] | ||
+ | \left(3^2,4^2\right) & 97 & \checkmark \\ [0.5ex] | ||
+ | \left(4^2,5^2\right) & 96 & \\ [0.5ex] | ||
+ | \left(5^2,6^2\right) & 95 & \checkmark \\ [0.5ex] | ||
+ | \left(6^2,7^2\right) & 94 & \\ | ||
+ | \vdots & \vdots & \vdots \\ [0.75ex] | ||
+ | \left(99^2,100^2\right) & 1 & \checkmark \\ [0.5ex] | ||
+ | \left(100^2,\infty\right) & 0 & \\ [0.5ex] | ||
+ | \end{array}</cmath> | ||
+ | Note that there are <math>50</math> valid intervals of <math>x.</math> We count the integers in these intervals: | ||
+ | <cmath>\begin{align*} | ||
+ | \left(2^2-1^2-1\right)+\left(4^2-3^2-1\right)+\left(6^2-5^2-1\right)+\cdots+\left(100^2-99^2-1\right)&=\underbrace{\left(2^2-1^2\right)}_{(2+1)(2-1)}+\underbrace{\left(4^2-3^2\right)}_{(4+3)(4-3)}+\underbrace{\left(6^2-5^2\right)}_{(6+5)(6-5)}+\cdots+\underbrace{\left(100^2-99^2\right)}_{(100+99)(100-99)}-50 \\ | ||
+ | &=\underbrace{(2+1)+(4+3)+(6+5)+\cdots+(100+99)}_{1+2+3+4+5+6+\cdots+99+100}-50 \\ | ||
+ | &=\frac{101(100)}{2}-50 \\ | ||
+ | &=5000. | ||
+ | \end{align*}</cmath> | ||
+ | In this case, there are <math>5000</math> such integers <math>n.</math> | ||
+ | </ol> | ||
+ | Together, the answer is <math>100+5000=\boxed{\textbf{(E) } 5100}.</math> | ||
+ | |||
+ | ~PCChess (Solution) | ||
+ | |||
+ | ~MRENTHUSIASM (Reformatting) | ||
+ | |||
+ | == Solution 2 (Casework) == | ||
+ | Notice that <math>P(x)</math> is nonpositive when <math>x</math> is between <math>100^2</math> and <math>99^2, 98^2</math> and <math>97^2, \cdots</math> , <math>2^2</math> and <math>1^2</math> (inclusive), because there are an odd number of negatives, which means that the number of values equals <cmath>((100+99)(100-99) + 1) + ((98+97)(98-97)+1) + \cdots + ((2+1)(2-1)+1).</cmath> | ||
+ | This reduces to <cmath>200 + 196 + 192 + \cdots + 4 = 4(1+2+\cdots + 50) = 4 \cdot\frac{50 \cdot 51}{2} = \boxed{\textbf{(E) } 5100}.</cmath> | ||
+ | ~Zeric | ||
+ | |||
+ | ~jesselan (Minor Edits) | ||
+ | |||
+ | == Solution 3 (End Behavior) == | ||
+ | We know that <math>P(x)</math> is a <math>100</math>-degree function with a positive leading coefficient. That is, <math>P(x)=x^{100}+ax^{99}+bx^{98}+...+\text{(constant)}</math>. | ||
+ | |||
+ | Since the degree of <math>P(x)</math> is even, its end behaviors match. And since the leading coefficient is positive, we know that both ends approach <math>\infty</math> as <math>x</math> goes in either direction, from which <cmath>\lim_{x\to-\infty} P(x)=\lim_{x\to\infty} P(x)=\infty.</cmath> So the first time <math>P(x)</math> is going to be negative is when it intersects the <math>x</math>-axis at an <math>x</math>-intercept and it's going to dip below. This happens at <math>1^2</math>, which is the smallest intercept. | ||
+ | |||
+ | However, when it hits the next intercept, it's going to go back up again into positive territory, we know this happens at <math>2^2</math>. And when it hits <math>3^2</math>, it's going to dip back into negative territory. Clearly, this is going to continue to snake around the intercepts until <math>100^2</math>. | ||
+ | |||
+ | To get the amount of integers below and/or on the <math>x</math>-axis, we simply need to count the integers. For example, the amount of integers in between the <math>[1^2,2^2]</math> interval we got earlier, we subtract and add one. <math>(2^2-1^2+1)=4</math> integers, so there are four integers in this interval that produce a negative result. | ||
+ | |||
+ | Doing this with all of the other intervals, we have <cmath>(2^2-1^2+1)+(4^2-3^2+1)+\cdots+(100^2-99^2+1)=\boxed{\textbf{(E) } 5100}</cmath> from Solution 2's result. | ||
+ | |||
+ | ~quacker88 | ||
+ | |||
+ | == Solution 4 (Fast) == | ||
+ | We know <math>P(x) \leq 0</math> when an odd number of its factors are positive and negative. For example, to make the first factor positive, <math>x \in [1^2, 2^2]</math>. then there will be a even number of positive factors. We would do <math>2^2 - 1^2 + 1 (\text{inclusive})</math> to find all integers that work. In short we can generalize too: | ||
+ | <cmath>\begin{align*} | ||
+ | x^2 - (x-1)^2 + 1 &= 2x \\ | ||
+ | x^2 - (x^2 - 2x + 1) + 1 &= 2x \\ | ||
+ | x^2 - x^2 + 2x - 1 + 1 &= 2x. \\ | ||
+ | \end{align*}</cmath> | ||
+ | But remember this only works when <math>x \in \{2, 4, 6, 8 \cdots 98, 100\}</math> because only then will there be a odd amount of positive and negative factors. So we can set <math>x = 2k</math>, for <math>k \in \{1, 2, 3, 4, \cdots 49, 50\}</math> Now we only have to solve: | ||
+ | <cmath>\sum_{k=1}^{k=50}2(2k) = 2\sum_{k = 1}^{k = 50}2k = 4\sum_{k = 1}^{k = 50}k = 4 \cdot \dfrac{(50)(51)}{2} = 2 \cdot (50)(51) = \boxed{\textbf{(E) } 5100}.</cmath> | ||
+ | ~Wiselion | ||
+ | |||
+ | == Video Solution by Pi Academy == | ||
+ | |||
+ | https://youtu.be/hqdnNqds2mw?si=dHhmbLrh3pWWIG9T | ||
+ | |||
+ | ~ Pi Academy | ||
+ | |||
+ | == Video Solutions == | ||
+ | https://youtu.be/3dfbWzOfJAI?t=4026 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | |||
+ | https://youtu.be/zl5rtHnk0rY | ||
+ | |||
+ | ~Education, The Study of Everything | ||
+ | |||
+ | https://youtu.be/RKlG6oZq9so | ||
+ | |||
+ | ~IceMatrix | ||
+ | |||
+ | https://www.youtube.com/watch?v=YDMMhSguq0w&list=PLeFyQ1uCoINM4D5Lgi5Y3KkfvQuYuIbj | ||
+ | |||
+ | -Walt S. | ||
+ | |||
+ | https://youtu.be/chDmeTQBxq8 | ||
+ | |||
+ | ~savannahsolver | ||
+ | |||
+ | https://youtu.be/R220vbM_my8?t=463 | ||
+ | |||
+ | ~ amritvignesh0719062.0 | ||
+ | |||
+ | == See Also == | ||
+ | {{AMC10 box|year=2020|ab=A|num-b=16|num-a=18}} | ||
+ | {{MAA Notice}} |
Latest revision as of 23:47, 3 November 2024
Contents
Problem
Define How many integers are there such that ?
Solution Visual Aid
Visualization that makes it easier to see solutions:
Note
Clearly, there are a finite amount of integers that result in being nonpositive. This is because there are an even number of factors of From here, you can read other solutions that count the amount of negative numbers of ~jasmineLOVER7254
Solution 1 (Casework)
We perform casework on
In this case, there are such integers
There are factors in and we need an odd number of them to be negative. We construct the table below: Note that there are valid intervals of We count the integers in these intervals: In this case, there are such integers
Together, the answer is
~PCChess (Solution)
~MRENTHUSIASM (Reformatting)
Solution 2 (Casework)
Notice that is nonpositive when is between and and , and (inclusive), because there are an odd number of negatives, which means that the number of values equals This reduces to ~Zeric
~jesselan (Minor Edits)
Solution 3 (End Behavior)
We know that is a -degree function with a positive leading coefficient. That is, .
Since the degree of is even, its end behaviors match. And since the leading coefficient is positive, we know that both ends approach as goes in either direction, from which So the first time is going to be negative is when it intersects the -axis at an -intercept and it's going to dip below. This happens at , which is the smallest intercept.
However, when it hits the next intercept, it's going to go back up again into positive territory, we know this happens at . And when it hits , it's going to dip back into negative territory. Clearly, this is going to continue to snake around the intercepts until .
To get the amount of integers below and/or on the -axis, we simply need to count the integers. For example, the amount of integers in between the interval we got earlier, we subtract and add one. integers, so there are four integers in this interval that produce a negative result.
Doing this with all of the other intervals, we have from Solution 2's result.
~quacker88
Solution 4 (Fast)
We know when an odd number of its factors are positive and negative. For example, to make the first factor positive, . then there will be a even number of positive factors. We would do to find all integers that work. In short we can generalize too: But remember this only works when because only then will there be a odd amount of positive and negative factors. So we can set , for Now we only have to solve: ~Wiselion
Video Solution by Pi Academy
https://youtu.be/hqdnNqds2mw?si=dHhmbLrh3pWWIG9T
~ Pi Academy
Video Solutions
https://youtu.be/3dfbWzOfJAI?t=4026
~ pi_is_3.14
~Education, The Study of Everything
~IceMatrix
https://www.youtube.com/watch?v=YDMMhSguq0w&list=PLeFyQ1uCoINM4D5Lgi5Y3KkfvQuYuIbj
-Walt S.
~savannahsolver
https://youtu.be/R220vbM_my8?t=463
~ amritvignesh0719062.0
See Also
2020 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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.