Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2005 AIME II Problems/Problem 13"
m (→‎Solution)
Line 4: Line 4:
 
== Solution ==
 
== Solution ==
  
−
Define the [[polynomial]] <math>Q(x) = P(x) - x + 7</math>.  By the givens, <math>Q(17) = 10 - 17 + 7 = 0</math>, <math>Q(24) = 17 - 24 + 7 = 0</math>, <math>Q(n_1) = n_1 + 3 - n_1 + 7 = 10</math> and <math>Q(n_2) = n_2 + 3 - n_2 + 7 = 10</math>.  Note that for any polynomial <math>R(x)</math> with [[integer]] [[coefficient]]s and any integers <math>a, b</math> we have <math>a - b</math> [[divisor|divides]] <math>P(a)-P(b)</math>.  So <math>n_1 - 17</math> divides <math>Q(n_1) - Q(17) = 10</math>, and so <math>n_1 - 17</math> must be one of the eight numbers <math>\pm1, \pm2, \pm5, \pm10</math> and so <math>n_1</math> must be one of the numbers <math>7, 12, 15, 16, 18, 19, 22</math> or <math>27</math>.  Similarly, <math>n_1 - 24</math> must divide <math>Q(n_1) - Q(24) = 10</math>, so <math>n_1 - 24</math> must be one of the eight numbers <math>14, 19, 22, 23, 25, 26, 29</math> or <math>34</math>.  Thus, <math>n_1</math> must be either 19 or 22.  Since <math>n_2</math> obeys the same conditions and <math>n_1</math> and <math>n_2</math> are different, one of them is 19 and the other is 22 and their product is <math>19 \cdot 22 = 418</math>.
+
Define the [[polynomial]] <math>Q(x) = P(x) - x + 7</math>.  By the givens, <math>Q(17) = 10 - 17 + 7 = 0</math>, <math>Q(24) = 17 - 24 + 7 = 0</math>, <math>Q(n_1) = n_1 + 3 - n_1 + 7 = 10</math> and <math>Q(n_2) = n_2 + 3 - n_2 + 7 = 10</math>.  Note that for any polynomial <math>R(x)</math> with [[integer]] [[coefficient]]s and any integers <math>a, b</math> we have <math>a - b</math> [[divisor|divides]] <math>P(a)-P(b)</math>.  So <math>n_1 - 17</math> divides <math>Q(n_1) - Q(17) = 10</math>, and so <math>n_1 - 17</math> must be one of the eight numbers <math>\pm1, \pm2, \pm5, \pm10</math> and so <math>n_1</math> must be one of the numbers <math>7, 12, 15, 16, 18, 19, 22</math> or <math>27</math>.  Similarly, <math>n_1 - 24</math> must divide <math>Q(n_1) - Q(24) = 10</math>, so <math>n_1</math> must be one of the eight numbers <math>14, 19, 22, 23, 25, 26, 29</math> or <math>34</math>.  Thus, <math>n_1</math> must be either 19 or 22.  Since <math>n_2</math> obeys the same conditions and <math>n_1</math> and <math>n_2</math> are different, one of them is 19 and the other is 22 and their product is <math>19 \cdot 22 = 418</math>.
  
 
== See also ==
 
== See also ==

Revision as of 20:46, 7 September 2006

Problem

Let $P(x)$ be a polynomial with integer coefficients that satisfies $P(17)=10$ and $P(24)=17.$ Given that $P(n)=n+3$ has two distinct integer solutions $n_1$ and $n_2,$ find the product $n_1\cdot n_2.$

Solution

Define the polynomial $Q(x) = P(x) - x + 7$. By the givens, $Q(17) = 10 - 17 + 7 = 0$, $Q(24) = 17 - 24 + 7 = 0$, $Q(n_1) = n_1 + 3 - n_1 + 7 = 10$ and $Q(n_2) = n_2 + 3 - n_2 + 7 = 10$. Note that for any polynomial $R(x)$ with integer coefficients and any integers $a, b$ we have $a - b$ divides $P(a)-P(b)$. So $n_1 - 17$ divides $Q(n_1) - Q(17) = 10$, and so $n_1 - 17$ must be one of the eight numbers $\pm1, \pm2, \pm5, \pm10$ and so $n_1$ must be one of the numbers $7, 12, 15, 16, 18, 19, 22$ or $27$. Similarly, $n_1 - 24$ must divide $Q(n_1) - Q(24) = 10$, so $n_1$ must be one of the eight numbers $14, 19, 22, 23, 25, 26, 29$ or $34$. Thus, $n_1$ must be either 19 or 22. Since $n_2$ obeys the same conditions and $n_1$ and $n_2$ are different, one of them is 19 and the other is 22 and their product is $19 \cdot 22 = 418$.

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2005_AIME_II_Problems/Problem_13&oldid=10066"