from
stringclasses
2 values
value
stringlengths
16
6.77k
human
Let $A$ be a point on the circle $x^2 + y^2 - 12x + 31 = 0,$ and let $B$ be a point on the parabola $y^2 = 4x.$ Find the smallest possible distance $AB.$
gpt
Completing the square on $x^2 + y^2 - 12x + 31 = 0,$ we get \[(x - 6)^2 + y^2 = 5.\]Thus, the center of the circle is $(6,0),$ and its radius is $\sqrt{5}.$ Note that the parabola $y^2 = 4x$ opens to the right. Let $2t$ be the $y$-coordinate of $B.$ Then \[x = \frac{y^2}{4} = \frac{(2t)^2}{4} = t^2,\]so $B = (t^2,2t).$ Let $C = (6,0),$ the center of the circle. [asy] unitsize(0.6 cm); real upperparab (real x) { return (sqrt(4*x)); } real lowerparab (real x) { return (-sqrt(4*x)); } pair A, B, C; C = (6,0); A = C + sqrt(5)*dir(140); B = (5,upperparab(5)); draw(Circle(C,sqrt(5))); draw(graph(upperparab,0,8)); draw(graph(lowerparab,0,8)); draw(A--B--C--cycle); dot("$A$", A, NW); dot("$B$", B, N); dot("$C$", C, S); [/asy] By the Triangle Inequality, $AB + AC \ge BC,$ so \[AB \ge BC - AC.\]Since $A$ is a point on the circle, $AC = \sqrt{5},$ so \[AB \ge BC - \sqrt{5}.\]So, we try to minimize $BC.$ We have that \begin{align*} BC^2 &= (t^2 - 6)^2 + (2t)^2 \\ &= t^4 - 12t^2 + 36 + 4t^2 \\ &= t^4 - 8t^2 + 36 \\ &= (t^2 - 4)^2 + 20 \\ &\ge 20, \end{align*}so $BC \ge \sqrt{20} = 2 \sqrt{5}.$ Then $AB \ge 2 \sqrt{5} - \sqrt{5} = \sqrt{5}.$ Equality occurs when $A = (5,2)$ and $B = (4,4),$ so the smallest possible distance $AB$ is $\boxed{\sqrt{5}}.$
human
Gracie and Joe are choosing numbers on the complex plane. Joe chooses the point $1+2i$. Gracie chooses $-1+i$. How far apart are Gracie and Joe's points?
gpt
To find the distance between two complex numbers, we find the magnitude of their difference. We calculate $(1+2i)-(-1+i)$ to be $2+i$. Now, $|2+i|=\sqrt{2^2+1^2}=\sqrt{5}$, thus the distance between the points is $\boxed{\sqrt{5}}$.
human
By partial fractions, \[\frac{1}{x(x + 1)(x + 2)(x + 3)(x + 4)} = \frac{A}{x} + \frac{B}{x + 1} + \frac{C}{x + 2} + \frac{D}{x + 3} + \frac{E}{x + 4}\]for some constants $A,$ $B,$ $C,$ $D,$ and $E.$ Find $A + B + C + D + E.$
gpt
Clearing the fractions, we get \begin{align*} 1 &= A(x + 1)(x + 2)(x + 3)(x + 4) \\ &\quad + Bx(x + 2)(x + 3)(x + 4) \\ &\quad + Cx(x + 1)(x + 3)(x + 4) \\ &\quad + Dx(x + 1)(x + 2)(x + 4) \\ &\quad + Ex(x + 1)(x + 2)(x + 3). \end{align*}We can use the usual technique of solving for each constant. Or, we can recognize that both sides represent the same polynomial, which means that the polynomial on the right must simplify to 1. Furthermore, $A + B + C + D + E$ is the coefficient of $x^4$ on the right-hand side, so $A + B + C + D + E = \boxed{0}.$
human
Find \[\sum_{n = 1}^\infty \frac{2^n}{1 + 2^n + 2^{n + 1} + 2^{2n + 1}}.\]
gpt
First, we can factor the denominator: \[1 + 2^n + 2^{n + 1} + 2^{2n + 1} = (1 + 2^n) + 2^{n + 1} (1 + 2^n) = (1 + 2^n)(1 + 2^{n + 1}).\]Then we can write the numerator $2^n$ as $(1 + 2^{n + 1}) - (1 + 2^n) = 2^n,$ so \[\frac{2^n}{1 + 2^n + 2^{n + 1} + 2^{2n + 1}} = \frac{(1 + 2^{n + 1}) - (1 + 2^n)}{(1 + 2^n)(1 + 2^{n + 1})} = \frac{1}{1 + 2^n} - \frac{1}{1 + 2^{n + 1}}.\]Hence, \begin{align*} \sum_{n = 1}^\infty \frac{2^n}{1 + 2^n + 2^{n + 1} + 2^{2n + 1}} &= \left( \frac{1}{1 + 2} - \frac{1}{1 + 2^2} \right) + \left( \frac{1}{1 + 2^2} - \frac{1}{1 + 2^3} \right) + \left( \frac{1}{1 + 2^3} - \frac{1}{1 + 2^4} \right) + \dotsb \\ &= \boxed{\frac{1}{3}}. \end{align*}
human
Let $p(x) = x^2 + bx + c,$ where $b$ and $c$ are integers. If $p(x)$ is factor of both $x^4 + 6x^2 + 25$ and $3x^4 + 4x^ 2+ 28x + 5,$ what is $p(1)$?
gpt
Since $p(x)$ is a factor of both $x^4 + 6x^2 + 25$ and $3x^4 + 4x^2 + 28x + 5,$ then it must be factor of \[3(x^4 + 6x^2 + 25) - (3x^4 + 4x^2 + 28x + 5) = 14x^2 - 28x + 70 = 14(x^2 - 2x + 5).\]Hence, $p(x) = x^2 - 2x + 5,$ and $p(1) = 1 - 2 + 5 = \boxed{4}.$
human
The function $f$ is defined on positive integers as follows: \[f(n) = \left\{ \begin{array}{cl} n + 10 & \text{if $n < 10$}, \\ f(n - 5) & \text{if $n \ge 10$}. \end{array} \right.\]Find the maximum value of the function.
gpt
We see that $f(n) = n + 10$ for $n = 1,$ 2, 3, $\dots,$ 9. Then \begin{align*} f(10) &= f(5) = 15, \\ f(11) &= f(6) = 16, \\ f(12) &= f(7) = 17, \\ f(13) &= f(8) = 18, \\ f(14) &= f(9) = 19, \\ f(15) &= f(10) = 15, \end{align*}and so on. At this point, the function becomes periodic, with period 5. Therefore, the maximum value of the function is $\boxed{19}.$
human
Given positive integers $x$ and $y$ such that $\frac{1}{x} + \frac{1}{2y} = \frac{1}{7}$, what is the least possible value of $xy$?
gpt
Multiplying through by $14xy$, we have $14y + 7x = 2xy$, so $2xy - 7x - 14y = 0$. We then apply Simon's Favorite Factoring Trick by adding $49$ to both sides to get $2xy - 7x - 14y + 49 = 49$. We can then factor this to get $$(x-7)(2y-7) = 49$$Since $49$ factors to $7 \cdot 7$ and $x$ and $y$ must be positive integers, the only possible solutions $(x,y)$ are $(8, 28), (14,7), \text{and } (56,4)$. Out of these, $(14,7)$ yields the least possible value $xy$ of $\boxed{98}$.
human
The graph of $y = f(x)$ is shown below. [asy] unitsize(0.3 cm); real func(real x) { real y; if (x >= -3 && x <= 0) {y = -2 - x;} if (x >= 0 && x <= 2) {y = sqrt(4 - (x - 2)^2) - 2;} if (x >= 2 && x <= 3) {y = 2*(x - 2);} return(y); } int i, n; for (i = -8; i <= 8; ++i) { draw((i,-8)--(i,8),gray(0.7)); draw((-8,i)--(8,i),gray(0.7)); } draw((-8,0)--(8,0),Arrows(6)); draw((0,-8)--(0,8),Arrows(6)); label("$x$", (8,0), E); label("$y$", (0,8), N); draw(graph(func,-3,3),red); label("$y = f(x)$", (4,-3), UnFill); [/asy] Which is the graph of $y = f \left( \frac{1 - x}{2} \right)$? [asy] unitsize(0.3 cm); picture[] graf; int i, n; real func(real x) { real y; if (x >= -3 && x <= 0) {y = -2 - x;} if (x >= 0 && x <= 2) {y = sqrt(4 - (x - 2)^2) - 2;} if (x >= 2 && x <= 3) {y = 2*(x - 2);} return(y); } real funcb(real x) { return(func((1 - x)/2)); } for (n = 1; n <= 5; ++n) { graf[n] = new picture; for (i = -8; i <= 8; ++i) { draw(graf[n],(i,-8)--(i,8),gray(0.7)); draw(graf[n],(-8,i)--(8,i),gray(0.7)); } draw(graf[n],(-8,0)--(8,0),Arrows(6)); draw(graf[n],(0,-8)--(0,8),Arrows(6)); label(graf[n],"$x$", (8,0), E); label(graf[n],"$y$", (0,8), N); } draw(graf[1],shift((-1/2,0))*xscale(1/2)*reflect((0,0),(0,1))*graph(func,-3,3),red); draw(graf[2],graph(funcb,-5,7),red); draw(graf[3],shift((1,0))*xscale(1/2)*reflect((0,0),(0,1))*graph(func,-3,3),red); draw(graf[4],shift((1/2,0))*xscale(2)*reflect((0,0),(0,1))*graph(func,-3,3),red); draw(graf[5],shift((1/2,0))*xscale(1/2)*reflect((0,0),(0,1))*graph(func,-3,3),red); label(graf[1], "A", (0,-10)); label(graf[2], "B", (0,-10)); label(graf[3], "C", (0,-10)); label(graf[4], "D", (0,-10)); label(graf[5], "E", (0,-10)); add(graf[1]); add(shift((20,0))*(graf[2])); add(shift((40,0))*(graf[3])); add(shift((10,-20))*(graf[4])); add(shift((30,-20))*(graf[5])); [/asy] Enter the letter of the graph of $y = f \left( \frac{1 - x}{2} \right).$
gpt
The graph of $y = f \left( \frac{1 - x}{2} \right)$ is produced by taking the graph of $y = f(x)$ and reflecting it in the $y$-axis, then stretching it horizontally by a factor of 2, then shifting it to the right by one unit. The correct graph is $\boxed{\text{B}}.$
human
If $2x+7$ is a factor of $6x^3+19x^2+cx+35$, find $c$.
gpt
Since $2x+7$ is a factor, we should get a remainder of $0$ when we divide $6x^3+19x^2+cx+35$. \[ \begin{array}{c|cccc} \multicolumn{2}{r}{3x^2} & -x&+5 \\ \cline{2-5} 2x+7 & 6x^3&+19x^2&+cx&+35 \\ \multicolumn{2}{r}{-6x^3} & -21x^2 \\ \cline{2-3} \multicolumn{2}{r}{0} & -2x^2 & +cx \\ \multicolumn{2}{r}{} & +2x^2 & +7x \\ \cline{3-4} \multicolumn{2}{r}{} & 0 & (c+7)x & + 35 \\ \multicolumn{2}{r}{} & & -10x & -35 \\ \cline{4-5} \multicolumn{2}{r}{} & & (c+7-10)x & 0 \\ \end{array} \]The remainder is $0$ if $c+7-10=0$, so $c=\boxed{3}$.
human
Let $A,$ $R,$ $M,$ and $L$ be positive real numbers such that \begin{align*} \log_{10} (AL) + \log_{10} (AM) &= 2, \\ \log_{10} (ML) + \log_{10} (MR) &= 3, \\ \log_{10} (RA) + \log_{10} (RL) &= 4. \end{align*}Compute the value of the product $ARML.$
gpt
We can write the given equations as \begin{align*} \log_{10} (A^2 ML) &= 2, \\ \log_{10} (RM^2 L) &= 3, \\ \log_{10} (AR^2 L) &= 4. \end{align*}Then $A^2 ML = 10^2,$ $RM^2 L = 10^3,$ and $AR^2 L = 10^4.$ Multiplying these equations, we get $A^3 R^3 M^3 L^3 = 10^9,$ so $ARML = 10^3 = \boxed{1000}.$
human
The function $f(x)$ satisfies \[f(xy) = xf(y)\]for all real numbers $x$ and $y.$ If $f(1) = 25,$ find $f(79).$
gpt
Setting $x = 79$ and $y = 1,$ we get \[f(79) = 79f(1) = 79 \cdot 25 = \boxed{1975}.\]
human
Let $x,$ $y,$ and $z$ be positive real numbers such that $x + y + z = 1.$ Find the maximum value of $x^3 y^2 z.$
gpt
By AM-GM, \begin{align*} x + y + z &= \frac{x}{3} + \frac{x}{3} + \frac{x}{3} + \frac{y}{2} + \frac{y}{2} + z \\ &\ge 6 \sqrt[6]{\frac{x^3 y^2 z}{108}}. \end{align*}Since $x + y + z = 1,$ this gives us \[x^3 y^2 z \le \frac{108}{6^6} = \frac{1}{432}.\]Equality occurs when $\frac{x}{3} = \frac{y}{2} = z.$ Along with the condition $x + y + z = 1,$ we can solve to get $x = \frac{1}{2},$ $y = \frac{1}{3},$ and $z = \frac{1}{6},$ so the maximum value is $\boxed{\frac{1}{432}}.$
human
Evaluate the polynomial \[ x^3 - 2 x^2 - 8 x + 4, \]where $x$ is the positive number such that $x^2 - 2x - 8 = 0$.
gpt
We note that \[ x^3 - 2x^2 - 8x + 4 = (x^2 - 2x - 8) \cdot x + 4 = 0 \cdot x + 4, \]since $x^2 - 2x - 8 = 0$. Now, $0 \cdot x + 4= \boxed{4}$, so this is our answer. We could also solve for $x$ from the information given. The expression $x^2 - 2x - 8$ factors as $(x + 2)(x-4)$. Thus $x$ must be equal to 4 or $-2$. Since $x$ is positive, $x$ must equal 4. Thus our expression is equal to \[ 4^3 - 2 \cdot 4^2 - 8 \cdot 4 + 4 . \]We can factor out a 4 to find that this is \[ 4( 4^2 - 2 \cdot 4 - 8 + 1) = 4( 16 - 8 - 8 +1) = 4 \cdot 1 = 4, \]as before. (Alternatively, since the problem statement implies that there is only one positive value of $x$ such that $x^2 - 2x - 8 = 0$, we could find the value 4 by trial and error, and then simplify as above.)
human
Let $a,$ $b,$ and $c$ be nonzero real numbers, and let \[x = \frac{b}{c} + \frac{c}{b}, \quad y = \frac{a}{c} + \frac{c}{a}, \quad z = \frac{a}{b} + \frac{b}{a}.\]Simplify $x^2 + y^2 + z^2 - xyz.$
gpt
Substituting and expanding, we get \begin{align*} x^2 + y^2 + z^2 - xyz &= \left( \frac{b}{c} + \frac{c}{b} \right)^2 + \left( \frac{a}{c} + \frac{c}{a} \right)^2 + \left( \frac{a}{b} + \frac{b}{a} \right)^2 - \left( \frac{b}{c} + \frac{c}{b} \right) \left( \frac{a}{c} + \frac{c}{a} \right) \left( \frac{a}{b} + \frac{b}{a} \right) \\ &= \frac{b^2}{c^2} + 2 + \frac{c^2}{b^2} + \frac{a^2}{c^2} + 2 + \frac{c^2}{a^2} + \frac{a^2}{b^2} + 2 + \frac{b^2}{a^2} - \left( \frac{a^2}{c^2} + \frac{b^2}{c^2} + 1 + \frac{b^2}{a^2} + \frac{a^2}{b^2} + 1 + \frac{c^2}{b^2} + \frac{c^2}{a^2} \right) \\ &= \boxed{4}. \end{align*}
human
The expression \[a(b - c)^3 + b(c - a)^3 + c(a - b)^3\]can be factored into the form $(a - b)(b - c)(c - a) p(a,b,c),$ for some polynomial $p(a,b,c).$ Find $p(a,b,c).$
gpt
We can expand, to get \[a(b - c)^3 + b(c - a)^3 + c(a - b)^3 = -a^3 b + ab^3 - b^3 c + bc^3 + a^3 c - ac^3.\]First, we take out a factor of $a - b$: \begin{align*} -a^3 b + ab^3 - b^3 c + bc^3 + a^3 c - ac^3 &= ab(b^2 - a^2) + (a^3 - b^3) c + (b - a) c^3 \\ &= ab(b - a)(b + a) + (a - b)(a^2 + ab + b^2) c + (b - a) c^3 \\ &= (a - b)(-ab(a + b) + (a^2 + ab + b^2) c - c^3) \\ &= (a - b)(-a^2 b + a^2 c - ab^2 + abc + b^2 c - c^3). \end{align*}We can then take out a factor of $b - c$: \begin{align*} -a^2 b + a^2 c - ab^2 + abc + b^2 c - c^3 &= a^2 (c - b) + ab(c - b) + c(b^2 - c^2) \\ &= a^2 (c - b) + ab(c - b) + c(b + c)(b - c) \\ &= (b - c)(-a^2 - ab + c(b + c)) \\ &= (b - c)(-a^2 - ab + bc + c^2). \end{align*}Finally, we take out a factor of $c - a$: \begin{align*} -a^2 - ab + bc + c^2 &= (c^2 - a^2) + b(c - a) \\ &= (c + a)(c - a) + b(c - a) \\ &= (c - a)(a + b + c). \end{align*}Thus, $p(a,b,c) = \boxed{a + b + c}.$
human
The graphs $y = 3(x-h)^2 + j$ and $y = 2(x-h)^2 + k$ have $y$-intercepts of $2013$ and $2014$, respectively, and each graph has two positive integer $x$-intercepts. Find $h$.
gpt
Setting $x=0$ in both equations, we get \[2013 = 3h^2 + j \quad \text{and} \quad 2014 = 2h^2 + k.\]Solving for $j$ and $k,$ we can rewrite the given equations as \[y = 3(x-h)^2 + (2013-3h^2) \quad \text{and} \quad y = 2(x-h)^2 + (2014-2h^2),\]or \[y = 3x^2 - 6xh + 2013 = 3(x^2-2hx+671) \quad \text{ and } \quad y = 2x^2 - 4hx + 2014 = 2(x^2 - 2hx + 1007).\]The left equation has positive integer roots, which must multiply to $671$ and sum to $2h.$ Similarly, the right equation has positive integer roots, which must multiply to $1007$ and sum to $2h.$ Since $671 = 61 \cdot 11$ and $1007 = 19 \cdot 53,$ we see that \[2h = 61 + 11 = 19 + 53 = 72,\]so $h = \boxed{36}.$
human
For which value of $x$ does the function $f(x) = \frac{2x^2 - 5x - 7}{x^2 - 4x + 1}$ cross its horizontal asymptote?
gpt
The horizontal asymptote of $f$ is the horizontal line that $f$ approaches as $x \to \pm \infty$. When the leading terms of the numerator and denominator have the same degree, that line is at the value equal to the ratio of the leading coefficients, namely $y = 2/1 = 2$. Setting this equal to $f(x)$, $$f(x) = 2 = \frac{2x^2 - 5x - 7}{x^2 - 4x + 1}.$$Clearing the denominator, $$2(x^2 - 4x + 1) = 2x^2 - 8x + 2 = 2x^2 - 5x - 7 \Longrightarrow 3x = 9 \Longrightarrow x = \boxed{3}.$$
human
Let $z$ and $w$ be complex numbers such that $|z| = 1$ and $|w| = 3$. If $|z+w| = 2$, what is $ \left | \frac{1}{z} + \frac{1}{w} \right|$?
gpt
We simplify the desired expression \[ \left | \frac{1}{z} + \frac{1}{w} \right| = \left | \frac{w+z}{wz} \right|. \]Now, using the fact that $|ab| = |a|\cdot |b|$ and $|a/b| = |a|/|b|$, we substitute in the values for the magnitudes given in the problem: \[ \left | \frac{w+z}{wz} \right| = \frac{|w+z|}{|w|\cdot|z|} = \frac{2}{(1)(3)} = \boxed{\frac{2}{3}}. \]
human
The admission fee for an exhibition is $ \$25$ per adult and $ \$12$ per child. Last Tuesday, the exhibition collected $ \$1950$ in admission fees from at least one adult and at least one child. Of all the possible ratios of adults to children at the exhibition last Tuesday, which one is closest to $ 1$?
gpt
Let $a$ be the number of adults and $c$ be the number of children. Then we have $$25a + 12c = 1950 = 25 \times 78.$$Rearranging terms gives us $$ a = 78 - \frac{12c}{25} .$$Since the number of adults must be an integer, this tells us that $c$ is a multiple of 25. The ratio we want close to 1 is $$\frac{a}{c} = \frac{78}{c} - \frac{12}{25}$$If $\frac{a}{c} = 1$, then $\frac{78}{c} - \frac{12}{25} = 1$, which means that $\frac{78}{c} = \frac{37}{25}$. In other words, $c = \frac{78 \cdot 25}{37}$. The multiple of 25 that comes closest to this is 50, and hence $c$ must be 50. Then, $a = 78 - \frac{12 \cdot 50}{25} = 54$. So the ratio of adults to children closest to 1 is $\frac{54}{50} = \boxed{\frac{27}{25}}.$
human
The three roots of the equation \[ax^3+bx^2+cx+d=0\]are $1,$ $2,$ and $3.$ Compute $\frac{c}{d}.$
gpt
By Vieta's formulas, \[\begin{aligned} 1 \cdot 2 +2 \cdot 3 + 3 \cdot 1=11 &= \frac ca \\1 \cdot 2 \cdot 3 = 6 &= - \frac da. \end{aligned}\]Dividing these two equations, we get $\frac{11}{6} = -\frac{c}{d},$ so $\frac{c}{d} = \boxed{-\frac{11}{6}}.$
human
Find the largest solution to \[\lfloor x \rfloor = 5 + 100 \{ x \},\]where $\{x\} = x - \lfloor x \rfloor.$
gpt
Since $0 \le \{x\} < 1,$ we have $0 \le 100 \{x\} < 100,$ so $5 \le 5 + 100 \{x\} < 105.$ Thus, \[5 \le \lfloor x\rfloor < 105.\]Since $\lfloor x\rfloor$ is an integer, the possible values of $\lfloor x\rfloor$ are $5, 6, \dots, 104.$ For each of these values of $\lfloor x\rfloor,$ we get a corresponding value \[\{x\} = \frac{\lfloor x\rfloor - 5}{100} = 0.01 \lfloor x \rfloor - 0.05,\]and then we have \[x = \lfloor x\rfloor + \{x\} = 1.01 \lfloor x \rfloor - 0.05.\]To maximize $x,$ we choose $\lfloor x \rfloor = 104,$ giving \[x = 1.01 \cdot 104 - 0.05 = \boxed{104.99}.\]
human
We can write \[\sum_{k = 1}^{100} (-1)^k \cdot \frac{k^2 + k + 1}{k!} = \frac{a}{b!} - c,\]where $a,$ $b,$ and $c$ are positive integers. Find the smallest possible value of $a + b + c.$
gpt
More generally, let \[S_n = \sum_{k = 1}^n (-1)^k \cdot \frac{k^2 + k + 1}{k!}\]for a positive integer $n.$ We can compute the first few values of $S_n$: \[ \renewcommand{\arraystretch}{1.5} \begin{array}{c|c} n & S_n \\ \hline 1 & -3 \\ 2 & \frac{1}{2} \\ 3 & -\frac{5}{3} \\ 4 & -\frac{19}{24} \\ 5 & -\frac{21}{20} \\ 6 & -\frac{713}{720} \end{array} \renewcommand{\arraystretch}{1} \]First, the denominators seem to be factors of $n!.$ Second, the fractions seem to be getting close to $-1.$ So, we re-write each sum in the form $\frac{*}{n!} - 1$: \[ \renewcommand{\arraystretch}{1.5} \begin{array}{c|c} n & S_n \\ \hline 1 & \frac{-2}{1!} - 1 \\ 2 & \frac{3}{2!} - 1 \\ 3 & \frac{-4}{3!} - 1 \\ 4 & \frac{5}{4!} - 1 \\ 5 & \frac{-6}{5!} - 1 \\ 6 & \frac{7}{6!} - 1 \\ \end{array} \renewcommand{\arraystretch}{1} \]Now the pattern is very clear: It appears that \[S_n = (-1)^n \cdot \frac{n + 1}{n!} - 1.\]So, set $T_n = (-1)^n \cdot \frac{n + 1}{n!} - 1.$ Since we expect the sum to telescope, we can compute the difference $T_k - T_{k - 1}$: \begin{align*} T_k - T_{k - 1} &= (-1)^k \cdot \frac{k + 1}{k!} - 1 - (-1)^{k - 1} \cdot \frac{k}{(k - 1)!} + 1 \\ &= (-1)^k \cdot \frac{k + 1}{k!} + (-1)^k \cdot \frac{k}{(k - 1)!} \\ &= (-1)^k \cdot \frac{k + 1}{k!} + (-1)^k \cdot \frac{k^2}{k!} \\ &= (-1)^k \cdot \frac{k^2 + k + 1}{k!}. \end{align*}Thus, indeed the sum telescopes, which verifies our formula \[S_n = (-1)^n \cdot \frac{n + 1}{n!} - 1.\]In particular, \[S_{100} = \frac{101}{100!} - 1.\]Then $a = 101,$ $b = 100,$ and $c = 1,$ so $a + b + c = \boxed{202}.$
human
If \[1 \cdot 1987 + 2 \cdot 1986 + 3 \cdot 1985 + \dots + 1986 \cdot 2 + 1987 \cdot 1 = 1987 \cdot 994 \cdot x,\]compute the integer $x.$
gpt
We can represent the sum as \[\sum_{n = 1}^{1987} n(1988 - n).\]This is equal to \begin{align*} \sum_{n = 1}^{1987} (1988n - n^2) &= 1988 \sum_{n = 1}^{1987} n - \sum_{n = 1}^{1987} n^2 \\ &= 1988 \cdot \frac{1987 \cdot 1988}{2} - \frac{1987 \cdot 1988 \cdot 3975}{6} \\ &= \frac{1987 \cdot 1988}{6} (3 \cdot 1988 - 3975) \\ &= \frac{1987 \cdot 2 \cdot 994}{6} \cdot 1989 \\ &= \frac{1987 \cdot 994}{3} \cdot 1989 \\ &= 1987 \cdot 994 \cdot 663. \end{align*}Thus, $x = \boxed{663}.$
human
Let $a,$ $b,$ and $c$ be nonnegative real numbers such that $a + b + c = 1.$ Find the maximum value of \[a + \sqrt{ab} + \sqrt[3]{abc}.\]
gpt
Our strategy is to add a number of inequalities like \[a + b \ge 2 \sqrt{ab},\]so that when we add them up, we get an inequality of the form \[t(a + b + c) \ge a + \sqrt{ab} + \sqrt[3]{abc}.\]To do so, we will use some variables, to make sure we use the most general forms of AM-GM. If we apply AM-GM to two terms, one of which is $pb,$ then to obtain $\sqrt{ab}$ on the right-hand side, the other term must be $\frac{1}{4p} a,$ as in \[\frac{1}{4p} a + pb \ge 2 \sqrt{\frac{1}{4p} a \cdot pb} = \sqrt{ab}. \quad (*)\]Note that equality holds when $\frac{1}{4p} a = pb,$ or $\frac{a}{b} = 4p^2.$ Thus, We then want an inequality of the form \[xa + yb + zc \ge \sqrt[3]{abc},\]where $x,$ $y,$ and $z$ are coefficients that we want to fill in. We want equality to hold here for the same values of $a$ and $b$ as in $(*)$. This means we want $xa = yb,$ or $\frac{x}{y} = \frac{b}{a} = \frac{1}{4p^2}.$ So, let $x = \frac{1}{4pk}$ and $y = \frac{p}{k}$: \[\frac{1}{4pk} a + \frac{p}{k} b + zc \ge \sqrt[3]{abc}.\]Finally, $z$ should be $\frac{4k^2}{27},$ so that we obtain $\sqrt[3]{abc}$ on the right-hand side: \[\frac{1}{4pk} a + \frac{p}{k} b + \frac{4k^2}{27} c \ge 3 \sqrt[3]{\frac{1}{4pk} a \cdot \frac{p}{k} b \cdot \frac{4k^2}{27} c} = \sqrt[3]{abc}. \quad (**)\]Thus, we have the inequalities \begin{align*} a &\ge a, \\ \frac{1}{4p} a + pb &\ge \sqrt{ab}, \\ \frac{1}{4pk} a + \frac{p}{k} b + \frac{4k^2}{27} c &\ge \sqrt[3]{abc}. \end{align*}When we add these up, we want the coefficients of $a,$ $b,$ and $c$ to be equal. Thus, \[1 + \frac{1}{4p} + \frac{1}{4pk} = p + \frac{p}{k} = \frac{4k^2}{27}.\]Isolating $p$ in $p + \frac{p}{k} = \frac{4k^2}{27},$ we find \[p = \frac{4k^3}{27(k + 1)}.\]Then \[1 + \frac{1}{4p} + \frac{1}{4pk} = \frac{4pk + k + 1}{4pk} = \frac{4k^2}{27}.\]Cross-multiplying, we get \[27(4pk + k + 1) = 16pk^3.\]Substituting $p = \frac{4k^3}{27(k + 1)},$ we get \[27 \left( 4k \cdot \frac{4k^3}{27(k + 1)} + k + 1 \right) = 16k^3 \cdot \frac{4k^3}{27(k + 1)}.\]Then \[27(16k^4 + 27(k + 1)^2) = 64k^3.\]This simplifies to $64k^6 - 432k^4 - 729k^2 - 1458k - 729 = 0.$ Fortunately, this polynomial has $k = 3$ as a root. Then $p = 1,$ and we get \[\frac{4}{3} a + \frac{4}{3} b + \frac{4}{3} c \ge a + \sqrt{ab} + \sqrt[3]{abc}.\]Therefore, \[a + \sqrt{ab} + \sqrt[3]{abc} \le \frac{4}{3}.\]Equality occurs when $a = \frac{16}{21},$ $b = \frac{4}{21},$ and $c = \frac{1}{21},$ so the maximum value is $\boxed{\frac{4}{3}}.$
human
A function $f$ is defined on the complex numbers by $f(z)=(a+bi)z,$ where $a$ and $b$ are positive numbers. This function has the property that for each complex number $z$, $f(z)$ is equidistant from both $z$ and the origin. Given that $|a+bi|=8$, find $b^2.$
gpt
From the given property, \[|f(z) - z| = |f(z)|.\]Then \[|(a + bi) z - z| = |(a + bi)z|,\]so $|a + bi - 1||z| = |a + bi||z|.$ Since this holds for all complex numbers $z,$ \[|a + bi - 1| = |a + bi| = 8.\]Then $(a - 1)^2 + b^2 = 64$ and $a^2 + b^2 = 64.$ Subtracting these equations, we get $2a - 1 = 0,$ so $a = \frac{1}{2}.$ Hence, \[b^2 = 64 - a^2 = 64 - \frac{1}{4} = \boxed{\frac{255}{4}}.\]
human
The graph of $y^2 + 2xy + 40|x|= 400$ partitions the plane into several regions. What is the area of the bounded region?
gpt
To deal with the $|x|$ term, we take cases on the sign of $x$: If $x \ge 0$, then we have $y^2+2xy+40x=400$. Isolating $x$, we have $x(2y+40) = 400-y^2$, which we can factor as \[2x(y+20) = (20-y)(y+20).\]Therefore, either $y=-20$, or $2x=20-y$, which is equivalent to $y=20-2x$. If $x < 0$, then we have $y^2+2xy-40x=400$. Again isolating $x$, we have $x(2y-40) = 400-y^2$, which we can factor as \[2x(y-20) = (20-y)(y+20).\]Therefore, either $y=20$, or $2x=-y-20$, which is equivalent to $y=-20-2x$. Putting these four lines together, we find that the bounded region is a parallelogram with vertices at $(0, \pm 20)$, $(20, -20)$, and $(-20, 20)$, as shown below: [asy]size(6cm);real f(real x) {return 20; } draw(graph(f, -25, 0)); real g(real x) { return -20; } draw(graph(g, 0, 25)); real h(real x){return 20-2*x;} draw(graph(h, 0,25)); real i(real x){return -20-2*x;} draw(graph(i, -25,0)); draw((0,-32)--(0,32),EndArrow); draw((-26,0)--(26,0),EndArrow); label("$x$",(26,0),S); label("$y$",(0,32),E); dot((0,20)--(0,-20)--(20,-20)--(-20,20));[/asy] The height of the parallelogram is $40$ and the base is $20$, so the area of the parallelogram is $40 \cdot 20 = \boxed{800}$.
human
Let $\{a_k\}$ be a sequence of integers such that $a_1=1$ and $a_{m+n}=a_m+a_n+mn,$ for all positive integers $m$ and $n.$ Find $a_{12}.$
gpt
We have that \begin{align*} a_2 &= a_1 + a_1 + 1 = 3, \\ a_3 &= a_1 + a_2 + 2 = 6, \\ a_6 &= a_3 + a_3 + 9 = 21, \\ a_{12} &= a_6 + a_6 + 36 = \boxed{78}. \end{align*}
human
Let $S$ be the set of positive real numbers. Let $f : S \to \mathbb{R}$ be a function such that \[f(x) f(y) = f(xy) + 2005 \left( \frac{1}{x} + \frac{1}{y} + 2004 \right)\]for all $x,$ $y > 0.$ Let $n$ be the number of possible values of $f(2),$ and let $s$ be the sum of all possible values of $f(2).$ Find $n \times s.$
gpt
Setting $y = 1,$ we get \[f(x) f(1) = f(x) + \frac{2005}{x} + 2005^2.\]The value $f(1)$ cannot be 1, and so we can solve for $f(x)$ to get \[f(x) = \frac{2005/x + 2005^2}{f(1) - 1}.\]In particular, \[f(1) = \frac{2005 + 2005^2}{f(1) - 1}.\]Then $f(1)^2 - f(1) - 2005^2 - 2005 = 0,$ which factors as $(f(1) - 2006)(f(1) + 2005) = 0.$ Hence, $f(1) = 2006$ or $f(1) = -2005.$ If $f(1) = 2006,$ then \[f(x) = \frac{2005/x + 2005^2}{2005} = \frac{1}{x} + 2005.\]We can check that this function works. If $f(1) = -2005,$ then \[f(x) = \frac{2005/x + 2005^2}{-2006}.\]We can check that this function does not work. Therefore, \[f(x) = \frac{1}{x} + 2005,\]so $n = 1$ and $s = \frac{1}{2} + 2005 = \frac{4011}{2},$ so $n \times s = \boxed{\frac{4011}{2}}.$
human
Let $x,$ $y,$ and $z$ be nonnegative real numbers such that $x + y + z = 2.$ Find the maximum value of \[(x^2 - xy + y^2)(x^2 - xz + z^2)(y^2 - yz + z^2).\]
gpt
Without loss of generality, we can assume that $z \le x$ and $z \le y.$ Then \[(x^2 - xy + y^2)(x^2 - xz + z^2)(y^2 - yz + z^2) \le (x^2 - xy + y^2) x^2 y^2.\]By AM-GM, \begin{align*} x^2 y^2 (x^2 - xy + y^2) &= \frac{4}{9} \left( \frac{3}{2} xy \right) \left( \frac{3}{2} xy \right) (x^2 - xy + y^2) \\ &\le \frac{4}{9} \left( \frac{\frac{3}{2} xy + \frac{3}{2} xy + (x^2 - xy + y^2)}{3} \right)^3 \\ &= \frac{4}{9} \left( \frac{x^2 + 2xy + y^2}{3} \right)^3 \\ &= \frac{4}{9} \cdot \frac{(x + y)^6}{27} \\ &\le \frac{4}{243} (x + y + z)^6 \\ &= \frac{256}{243}. \end{align*}Equality occurs when $x = \frac{4}{3},$ $y = \frac{2}{3},$ and $z = 0,$ so the maximum value is $\boxed{\frac{256}{243}}.$
human
Let $a$ and $b$ be real numbers so that the roots of \[z^2 + (10 + ai) z + (27 + bi) = 0\]are complex conjugates. Enter the ordered pair $(a,b).$
gpt
Let $z = x + yi,$ where $x$ and $y$ are real numbers. Then both \[z + \overline{z} = (x + yi) + (x - yi) = 2x,\]and \[z \overline{z} = (x + yi)(x - yi) = x^2 + y^2\]are real numbers. Therefore, by Vieta's formulas, all the coefficients must be real numbers. Then $(a,b) = \boxed{(0,0)}.$
human
For a positive integer $n,$ let \[H_n = 1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n}.\]Compute \[\sum_{n = 1}^\infty \frac{1}{(n + 1) H_n H_{n + 1}}.\]
gpt
We can write \[\frac{1}{(n + 1) H_n H_{n + 1}} = \frac{\frac{1}{n + 1}}{H_n H_{n + 1}} = \frac{H_{n + 1} - H_n}{H_n H_{n + 1}} = \frac{1}{H_n} - \frac{1}{H_{n + 1}}.\]Thus, \begin{align*} \sum_{n = 1}^\infty \frac{1}{(n + 1) H_n H_{n + 1}} &= \sum_{n = 1}^\infty \left( \frac{1}{H_n} - \frac{1}{H_{n + 1}} \right) \\ &= \left( \frac{1}{H_1} - \frac{1}{H_2} \right) + \left( \frac{1}{H_2} - \frac{1}{H_3} \right) + \left( \frac{1}{H_3} - \frac{1}{H_4} \right) + \dotsb \\ &= \frac{1}{H_1} = \boxed{1}. \end{align*}Note that this result depends on the fact that $H_n \to \infty$ as $n \to \infty.$ We can prove this as follows: \begin{align*} \frac{1}{2} &\ge \frac{1}{2}, \\ \frac{1}{3} + \frac{1}{4} &> \frac{1}{4} + \frac{1}{4} = \frac{1}{2}, \\ \frac{1}{5} + \frac{1}{6} + \frac{1}{7} + \frac{1}{8} &> \frac{1}{8} + \frac{1}{8} + \frac{1}{8} + \frac{1}{8} = \frac{1}{2}, \end{align*}and so on. Thus, \[1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \dotsb > 1 + \frac{1}{2} + \frac{1}{2} + \dotsb,\]which shows that $H_n \to \infty$ as $n \to \infty.$
human
Solve for $x$ in the equation \[2^{(16^x)} = 16^{(2^x)}.\]
gpt
We can write \[16^{(2^x)} = (2^4)^{(2^x)} = 2^{4 \cdot 2^x}.\]Then $2^{16^x} = 2^{4 \cdot 2^x},$ so \[16^x = 4 \cdot 2^x.\]In turn, we can write this as \[2^{4x} = 2^{x + 2},\]so $4x = x + 2.$ Therefore, $x = \boxed{\frac{2}{3}}.$
human
Find the remainder when $x^{100}$ is divided by $(x + 1)^3.$
gpt
We can write \begin{align*} x^{100} &= [(x + 1) - 1]^{100} \\ &= (x + 1)^{100} - \binom{100}{1} (x + 1)^{99} + \binom{100}{2} (x + 1)^{98} + \dots - \binom{100}{97} (x + 1)^3 + \binom{100}{98} (x + 1)^2 - \binom{100}{99} (x + 1) + 1. \end{align*}When this is divided by $(x + 1)^3,$ the remainder is then \[\binom{100}{98} (x + 1)^2 - \binom{100}{99} (x + 1) + 1 = \boxed{4950x^2 + 9800x + 4851}.\]
human
Consider the sequence of numbers defined recursively by $t_1=1$ and for $n>1$ by $t_n=1+t_{n/2}$ when $n$ is even and by $t_n=\frac{1}{t_{n-1}}$ when $n$ is odd. Given that $t_n=\frac{19}{87}$, find $n.$
gpt
We can easily prove by induction that $t_k > 1$ for $k$ even, and $0 < t_k < 1$ for $k$ odd. Hence, $n$ is odd, and $t_{n - 1} = \frac{87}{19}.$ Then $t_{n - 1}$ must have been generated from the rule of adding 1, which means $n - 1$ is even. Furthermore, $\frac{87}{19} = 4 + \frac{11}{19},$ so this rule must have been applied four times. Thus, $n - 1$ is divisible by 16, and \[t_{\frac{n - 1}{16}} = \frac{11}{19}.\]Since $\frac{11}{19} < 1,$ this term must have been generated from the rule of taking the reciprocal, which means $\frac{n - 1}{16}$ is odd. Thus, \[t_{\frac{n - 17}{16}} = \frac{19}{11}.\]We can keep working backwards to produce the following terms: \begin{align*} t_{\frac{n - 17}{32}} &= \frac{8}{11}, \\ t_{\frac{n - 49}{32}} &= \frac{11}{8}, \\ t_{\frac{n - 49}{64}} &= \frac{3}{8}, \\ t_{\frac{n - 113}{64}} &= \frac{8}{3}, \\ t_{\frac{n - 113}{256}} &= \frac{2}{3}, \\ t_{\frac{n - 369}{256}} &= \frac{3}{2}, \\ t_{\frac{n - 369}{512}} &= \frac{1}{2}, \\ t_{\frac{n - 881}{512}} &= 2, \\ t_{\frac{n - 881}{1024}} &= 1. \end{align*}Then $\frac{n - 881}{1024} = 1,$ so $n = \boxed{1905}.$
human
Let $a,$ $b,$ $c,$ $d$ be distinct real numbers such that the roots of $x^2 - 10ax - 11b = 0$ are $c$ and $d,$ and the roots of $x^2 - 10cx - 11d = 0$ are $a$ and $b.$ Find the value of $a + b + c + d.$
gpt
By Vieta's formulas, \begin{align*} c + d &= 10a, \\ cd &= -11b, \\ a + b &= 10c, \\ ab &= -11d. \end{align*}From the first equation, \[d = 10a - c.\]From the third equation, \[b = 10c - a.\]Substituting into the second and fourth equations, we get \begin{align*} c(10a - c) &= -11(10c - a), \\ a(10c - a) &= -11(10a - c). \end{align*}Expanding, we get \begin{align*} 10ac - c^2 &= -110c + 11a, \\ 10ac - a^2 &= -110a + 11c. \end{align*}Subtracting these equations, we get \[a^2 - c^2 = 121a - 121c,\]so $(a + c)(a - c) = 121(a - c).$ Since $a$ and $c$ are distinct, we can divide both sides by $a - c,$ to get \[a + c = 121.\]Hence, $a + b + c + d = 10c + 10a = 10(a + c) = \boxed{1210}.$
human
One of the roots of \[ax^3 + 3x^2 + bx - 65 = 0,\]is $-2 - 3i,$ where $a$ and $b$ are real numbers. Find the real root of this cubic polynomial.
gpt
Since $-2 - 3i$ is a root \[a (-2 - 3i)^3 + 3 (-2 - 3i)^2 + b (-2 - 3i) - 65 = 0.\]Expanding, we get \[(-80 + 46a - 2b) + (36 - 9a - 3b)i = 0.\]Then $-80 + 46a - 2b = 0$ and $36 - 9a - 3b = 0.$ Solving, we find $a = 2$ and $b = 6.$ The cubic polynomial is then $2x^3 + 3x^2 + 6x - 65 = 0,$ which factors as $(2x - 5)(x^2 + 4x + 13) = 0.$ Therefore, the real root is $\boxed{\frac{5}{2}}.$
human
Let $f(x) : \mathbb{R} \to \mathbb{R}$ be a function such that \[\frac{f(x) f(y) - f(xy)}{3} = x + y + 2\]for all $x,$ $y \in \mathbb{R}.$ Find $f(x).$
gpt
We write the functional equation as \[f(x)f(y) - f(xy) = 3x + 3y + 6.\]Setting $x = y = 0,$ we get \[f(0)^2 - f(0) = 6.\]Then $f(0)^2 - f(0) - 6 = 0,$ which factors as $(f(0) - 3)(f(0) + 2) = 0.$ Hence, $f(0) = 3$ or $f(0) = -2.$ Setting $y = 0,$ we get \[f(0) f(x) - f(0) = 3x + 6.\]Then \[f(x) - 1 = \frac{3x + 6}{f(0)},\]so \[f(x) = \frac{3x + 6}{f(0)} + 1.\]If $f(0) = 3,$ then $f(x) = x + 3,$ which does satisfy the functional equation. If $f(0) = -2,$ then \[f(x) = -\frac{3}{2} x - 2,\]which does not satisfy the functional equation. Therefore, $f(x) = \boxed{x + 3}.$
human
Let $x = (2 + \sqrt{3})^{1000},$ let $n = \lfloor x \rfloor,$ and let $f = x - n.$ Find \[x(1 - f).\]
gpt
Let $\alpha = 2 + \sqrt{3}$ and $\beta = 2 - \sqrt{3}.$ Then consider the number \begin{align*} N &= \alpha^{1000} + \beta^{1000} \\ &= (2 + \sqrt{3})^{1000} + (2 - \sqrt{3})^{1000} \\ &= 2^{1000} + \binom{1000}{1} 2^{999} (\sqrt{3}) + \binom{1000}{2} 2^{998} (\sqrt{3})^2 + \binom{1000}{3} (\sqrt{3})^3 + \dotsb \\ &\quad + 2^{1000} - \binom{1000}{1} 2^{999} (\sqrt{3}) + \binom{1000}{2} 2^{998} (\sqrt{3})^2 - \binom{1000}{3} (\sqrt{3})^3 + \dotsb. \end{align*}Adding $(2 + \sqrt{3})^{1000}$ and $(2 - \sqrt{3})^{1000}$, we see that all the terms containing a $\sqrt{3}$ will cancel, meaning that we are left with an integer. Furthermore, \[\beta = 2 - \sqrt{3} = \frac{(2 - \sqrt{3})(2 + \sqrt{3})}{2 + \sqrt{3}} = \frac{1}{2 + \sqrt{3}} < 1,\]so $0 < \beta^{1000} < 1.$ Therefore, \[N - 1 < \alpha^{1000} < N,\]which means $n = \lfloor \alpha^{1000} \rfloor = N - 1.$ Then \[f = x - n = \alpha^{1000} - (N - 1) = 1 - \beta^{1000},\]so $1 - f = \beta^{1000}.$ Hence, \begin{align*} x(1 - f) &= \alpha^{1000} \beta^{1000} \\ &= (\alpha \beta)^{1000} \\ &= [(2 + \sqrt{3})(2 - \sqrt{3})]^{1000} \\ &= 1^{1000} \\ &= \boxed{1}. \end{align*}
human
Let $f : \mathbb{R} \to \mathbb{R}$ be a function such that \[f(f(x) + y) = f(x^2 - y) + 4f(x) y\]for all real numbers $x$ and $y.$ Let $n$ be the number of possible values of $f(3),$ and let $s$ be the sum of all possible values of $f(3).$ Find $n \times s.$
gpt
Let $y = \frac{x^2 - f(x)}{2}.$ Then \[f \left( f(x) + \frac{x^2 - f(x)}{2} \right) = f \left( x^2 - \frac{x^2 - f(x)}{2} \right) + 4f(x) \cdot \frac{x^2 - f(x)}{2}.\]Simplifying, we get \[f \left( \frac{x^2 + f(x)}{2} \right) = f \left( \frac{x^2 + f(x)}{2} \right) + 2f(x) (x^2 - f(x)),\]so $f(x) (x^2 - f(x)) = 0.$ This tells us that for each individual value of $x,$ either $f(x) = 0$ or $f(x) = x^2.$ (Note that we cannot conclude that the only solutions are $f(x) = 0$ or $f(x) = x^2.$) Note that in either case, $f(0) = 0.$ We can verify that the function $f(x) = x^2$ is a solution. Suppose there exists a nonzero value $a$ such that $f(a) \neq a^2.$ Then $f(a) = 0.$ Setting $x = 0$ in the given functional equation, we get \[f(y) = f(-y).\]In other words, $f$ is even. Setting $x = a$ in the given functional equation, we get \[f(y) = f(a^2 - y).\]Replacing $y$ with $-y,$ we get $f(-y) = f(a^2 + y).$ Hence, \[f(y) = f(y + a^2)\]for all values of $y.$ Setting $y = a^2$ in the given functional equation, we get \[f(f(x) + a^2) = f(x^2 - a^2) + 4a^2 f(x).\]We know $f(f(x) + a^2) = f(f(x))$ and $f(x^2 - a^2) = f(x^2),$ so \[f(f(x)) = f(x^2) + 4a^2 f(x). \quad (*)\]Setting $y = 0$ in the given functional equation, we get \[f(f(x)) = f(x^2).\]Comparing this equation to $(*),$ we see that $4a^2 f(x) = 0$ for all values of $x,$ which means $f(x) = 0$ for all $x.$ We see that this function satisfies the given functional equation. Thus, there are two functions that work, namely $f(x) = 0$ and $f(x) = x^2.$ This means $n = 2$ and $s = 0 + 9 = 9,$ so $n \times s = \boxed{18}.$
human
Find the maximum number of real roots to a polynomial of the form \[x^n + x^{n - 1} + \dots + x + 1 = 0,\]where $n$ is a positive integer.
gpt
If $x^n + x^{n - 1} + \dots + x + 1 = 0,$ then \[(x - 1)(x^n + x^{n - 1} + \dots + x + 1) = 0,\]which expands as $x^{n + 1} - 1 = 0.$ Then $x^{n + 1} = 1.$ The only possible real roots of this equation are $x = 1$ and $x = -1.$ Note that $x = 1$ cannot be a real root of \[x^n + x^{n - 1} + \dots + x + 1 = 0,\]but $x = -1$ is a root whenever $n$ is odd. Therefore, the maximum number of real roots is $\boxed{1}.$
human
If $f(x) = 5x-4$, what is $f(f(f(2)))$?
gpt
We have that \begin{align*} f(2) &= 5(2) - 4 = 6, \\ f(f(2)) &= f(6) = 5(6) - 4 = 26, \\ f(f(f(2))) &= f(f(6)) = f(26) = 5(26) - 4 = \boxed{126}. \end{align*}
human
Find all the solutions to \[\sqrt[3]{2 - x} + \sqrt{x - 1} = 1.\]Enter all the solutions, separated by commas.
gpt
Let $y = \sqrt[3]{2 - x}.$ Then $y^3 = 2 - x,$ so $x = 2 - y^3.$ Then \[\sqrt{x - 1} = \sqrt{1 - y^3},\]so we can write the given equation as $y + \sqrt{1 - y^3} = 1.$ Then \[\sqrt{1 - y^3} = 1 - y.\]Squaring both sides, we get $1 - y^3 = 1 - 2y + y^2,$ so $y^3 + y^2 - 2y = 0.$ This factors as $y(y - 1)(y + 2) = 0,$ so $y$ can be 0, 1, or $-2.$ These lead to $x = \boxed{1,2,10}.$ We check that these solutions work.
human
Let $(x, y)$ be a solution to the system of equations \[\begin{aligned} \lfloor x \rfloor + \{y\} &= 2.4, \\ \{x\} + \lfloor y \rfloor &= 5.1. \end{aligned} \]Compute $|x - y|.$
gpt
Consider the first equation, \[\lfloor x \rfloor + \{y\} = 2.4.\]Because $\lfloor x \rfloor$ is an integer, while $0 \le \{y\} < 1,$ the only possibility is that $\lfloor x \rfloor = 2$ and $\{y\} = 0.4.$ Similarly, from the second equation, we get $\{x\} = 0.1$ and $\lfloor y \rfloor = 5.$ Then \[x = \lfloor x \rfloor + \{x\} = 2.1 \]and \[y = \lfloor y \rfloor + \{y\} = 5.4,\]so $|x-y| = |2.1-5.4| = \boxed{3.3}.$
human
Compute $$\sum_{k=1}^{1000} k(\lceil \log_{\sqrt{2}}{k}\rceil- \lfloor\log_{\sqrt{2}}{k} \rfloor).$$
gpt
First note that \[\lceil x \rceil - \lfloor x \rfloor = \begin{cases}1 & \text{if $x$ is not an integer}, \\ 0 & \text{if $x$ is an integer}. \end{cases} \]Thus for any positive integer $k$, \[\lceil \log_{\sqrt{2}}{k}\rceil-\lfloor \log_{\sqrt{2}}{k}\rfloor= \begin{cases}1 & \text{if $k$ not an integer power of $\sqrt{2}$}, \\ 0 & \text{if $k$ an integer power of $\sqrt{2}$}. \end{cases}\]The integers $k$, $1 \leq k \leq 1000$, that are integer powers of $\sqrt{2}$ are described by $k = 2^j$, $0 \leq j \leq 9$. Thus \[\sum_{k=1}^{1000} k (\lceil \log_{\sqrt{2}}{k}\rceil - \lfloor \log_{\sqrt{2}}{k}\rfloor) = \sum_{k=1}^{1000}k - \sum_{j=0}^9 2^j = \frac{1000 \cdot 1001}{2} - 1023 = \boxed{499477}.\]
human
A polynomial with integer coefficients is of the form \[x^4 + a_3 x^3 + a_2 x^2 + a_1 x + 18.\]You are told that the integer $r$ is a double root of this polynomial. (In other words, the polynomial is divisible by $(x - r)^2.$) Enter all the possible values of $r,$ separated by commas.
gpt
By the Integer Root Theorem, an integer root must divide the constant term. In this case, $r^2$ must divide 18. Thus, the only possible values of $r$ are $\boxed{-3,-1,1,3}.$
human
Part of the graph of $f(x) = ax^3 + bx^2 + cx + d$ is shown. What is $b$? [asy] unitsize(1.5 cm); real func(real x) { return((x + 1)*(x - 1)*(x - 2)); } draw(graph(func,-1.1,1.5)); draw((-1.5,0)--(1.5,0),Arrows(6)); draw((0,-1)--(0,2.5),Arrows(6)); label("$x$", (1.5,0), E); label("$f(x)$", (0,2.5), N); dot("$(-1,0)$", (-1,0), SE, fontsize(10)); dot("$(1,0)$", (1,0), SW, fontsize(10)); dot("$(0,2)$", (0,2), NE, fontsize(10)); [/asy]
gpt
We have \[ 0 = f(-1) = -a+b-c+d\]and \[0 = f(1) = a+b+c+d, \]so $b+d=0$. Also $d=f(0) = 2$, so $b=\boxed{-2}$.
human
Let $x$ be a real number. Consider the following five statements: $0 < x^2 < 1$ $x^2 > 1$ $-1 < x < 0$ $0 < x < 1$ $0 < x - x^2 < 1$ What is the maximum number of these statements that can be true for any value of $x$?
gpt
One the first two statements, at most one of them can be true ($x^2$ cannot be both less than 1 and greater than 1). Of the next two statements, at most one of them can be true ($x$ cannot be both less than 0 and greater than 0). Hence, at most three statements can be true. For $0 < x < 1,$ the first, fourth, and fifth statements are true, so the maximum number of statements that can be true is $\boxed{3}.$
human
In the complex plane, the graph of $|z - 3| = 2|z + 3|$ intersects the graph of $|z| = k$ in exactly one point. Find all possible values of $k.$ Enter all possible values, separated by commas.
gpt
Let $z = x + yi,$ where $x$ and $y$ are real numbers. Then the equation $|z - 3| = 2|z + 3|$ becomes \[|x + yi - 3| = 2 |x + yi + 3|,\]so \[(x - 3)^2 + y^2 = 4[(x + 3)^2 + y^2].\]This simplifies to $x^2 + 10x + y^2 + 9 = 0.$ Completing the square, we get \[(x + 5)^2 + y^2 = 4^2.\]This is the circle centered at $-5$ with radius 4. [asy] unitsize(0.4 cm); draw(Circle((0,0),1),red); draw(Circle((0,0),9),red); draw(Circle((-5,0),4)); draw((-10.5,0)--(10.5,0)); draw((0,-10.5)--(0,10.5)); label("$4$", (-3,0), N); label("$4$", (-7,0), N); dot("$-5$", (-5,0), S); [/asy] The graph of $|z| = k$ is a circle centered at the origin with radius $k.$ We see that the circles with radius $\boxed{1}$ and $\boxed{9}$ intersect the circle $(x + 5)^2 + y^2 = 4^2$ in exactly one point.
human
Let $a_1,$ $a_2,$ $a_3$ be the first three terms of a geometric sequence. If $a_1 = 1,$ find the smallest possible value of $4a_2 + 5a_3.$
gpt
Let $r$ be the common ratio. Then $a_2 = r$ and $a_3 = r^2,$ so \[4a_2 + 5a_3 = 4r + 5r^2 = 5 \left( r + \frac{2}{5} \right)^2 - \frac{4}{5}.\]Thus, the minimum value is $\boxed{-\frac{4}{5}},$ which occurs when $r = -\frac{2}{5}.$
human
Let $F_n$ be the Fibonacci sequence, that is, $F_0 = 0$, $F_1 = 1$, and $F_{n+2} = F_{n+1} + F_n$. Compute \[\sum_{n=0}^{\infty} \frac{F_n}{10^n}.\]
gpt
Let $S = \sum_{n = 0}^\infty \frac{F_n}{10^n}.$ Then \begin{align*} S &= F_0 + \frac{F_1}{10} + \frac{F_2}{10^2} + \frac{F_3}{10^3} + \dotsb \\ &= \frac{F_0 + 1}{10} + \frac{F_1 + F_0}{10^2} + \frac{F_2 + F_1}{10^3} + \dotsb \\ &= \frac{1}{10} + \frac{F_0}{10} + \frac{F_1}{10^2} + \frac{F_2}{10^3} + \dotsb + \frac{F_0}{10^2} + \frac{F_1}{10^3} + \dotsb \\ &= \frac{1}{10} + \frac{1}{10} S + \frac{1}{10^2} S. \end{align*}Solving, we find $S = \boxed{\frac{10}{89}}.$