Found problems: 4275
Let $a$, $b$, and $c$ be three distinct one-digit numbers. What is the maximum value of the sum of the roots of the equation $(x-a)(x-b)+(x-b)(x-c)=0$?
$ \textbf {(A) } 15 \qquad \textbf {(B) } 15.5 \qquad \textbf {(C) } 16 \qquad \textbf {(D) } 16.5 \qquad \textbf {(E) } 17 $
$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$
Find all polynomials $f$ with real coefficients such that for all reals $a,b,c$ such that $ab+bc+ca = 0$ we have the following relations
\[ f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c). \]
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Let \[ p(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x+a_0, \] where the coefficients $a_i$ are integers. If $p(0)$ and $p(1)$ are both odd, show that $p(x)$ has no integral roots.
Let $A$ be a set of polynomials with real coefficients and let them satisfy the following conditions:
[b](i)[/b] if $f \in A$ and $\deg( f ) \leq 1$, then $f(x) = x - 1$;
[b](ii)[/b] if $f \in A$ and $\deg( f ) \geq 2$, then either there exists $g \in A$ such that $f(x) = x^{2+\deg(g)} + xg(x) -1$ or there exist $g, h \in A$ such that $f(x) = x^{1+\deg(g)}g(x) + h(x)$;
[b](iii)[/b] for every $g, h \in A$, both $x^{2+\deg(g)} + xg(x) -1$ and $x^{1+\deg(g)}g(x) + h(x)$ belong to $A.$
Let $R_n(f)$ be the remainder of the Euclidean division of the polynomial $f(x)$ by $x^n$. Prove that for all $f \in A$ and for all natural numbers $n \geq 1$ we have $R_n(f)(1) \leq 0$, and that if $R_n(f)(1) = 0$ then $R_n(f) \in A$.
Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds:
\[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\]
Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$
\[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]
Let $a \in \mathbb{R}.$ Show that for $n \geq 2$ every non-real root $z$ of polynomial $X^{n+1}-X^2+aX+1$ satisfies the condition $|z| > \frac{1}{\sqrt[n]{n}}.$
Determine all positive integers $n$ for which there exists a polynomial $f(x)$ with real coefficients, with the following properties:
(1) for each integer $k$, the number $f(k)$ is an integer if and only if $k$ is not divisible by $n$;
(2) the degree of $f$ is less than $n$.
[i](Hungary) Géza Kós[/i]
Find three different polynomials $P(x)$ with real coefficients such that $P\left(x^2 + 1\right) = P(x)^2 + 1$ for all real $x$.
The following expression $x^{30} + *x^{29} +...+ *x+8 = 0$ is written on a blackboard. Two players $A$ and $B$ play the following game. $A$ starts the game. He replaces all the asterisks by the natural numbers from $1$ to $30$ (using each of them exactly once). Then player $B$ replace some of" $+$ "by ” $-$ "(by his own choice). The goal of $A$ is to get the equation having a real root greater than $10$, while the goal of $B$ is to get the equation having a real root less that or equal to $10$. If both of the players achieve their goals or nobody of them achieves his goal, then the result of the game is a draw. Otherwise, the player achieving his goal is a winner.
Who of the players wins if both of them play to win?
(I.Bliznets)
Two of the squares of a $ 7\times 7$ checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane of the board. How many inequivalent color schemes are possible?
Let be two real reducible quadratic polynomials $ P,Q $ in one variable. Prove that if $ P-Q $ is irreducible, then $ P+Q $ is reducible.
Suppose a real number $a$ is a root of a polynomial with integer coefficients $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$. Let $G=|a_n|+|a_{n-1}|+...+|a_1|+|a_0|$. We say that $G$ is a [i]gingado [/i] of $a$.
For example, as $2$ is root of $P(x)=x^2-x-2$, $G=|1|+|-1|+|-2|=4$, we say that $4$ is a [i]gingado[/i] of $2$. What is the fourth largest real number $a$ such that $3$ is a [i]gingado [/i] of $a$?
Find the least positive integer \(M\) for which there exist a positive integer \(n\) and polynomials \(P_1(x)\), \(P_2(x)\), \(\ldots\), \(P_n(x)\) with integer coefficients satisfying \[Mx=P_1(x)^3+P_2(x)^3+\cdots+P_n(x)^3.\]
[i]Proposed by Karthik Vedula[/i]
Let $ax^{3}+bx^{2}+cx+d$ be a polynomial with integer coefficients $a,$ $b,$ $c,$ $d$ such that $ad$ is an odd number and $bc$ is an even number. Prove that (at least) one root of the polynomial is irrational.
A line through the origin passes through the curve whose equation is $5y=2x^2-9x+10$ at two points whose $x-$coordinates add up to $77.$ Find the slope of the line.
$f(x)$ is a monic polynomial of degree $2$ with integer coefficients such that $f(x)$ doesn't have any real roots and also $f(0)$ is a square-free integer (and is not $1$ or $-1$). Prove that for every integer $n$ the polynomial $f(x^n)$ is irreducible over $\mathbb Z[x]$.
[i]proposed by Mohammadmahdi Yazdi[/i]
Let $u$ be the positive root of the equation $x^2+x-4=0$. The polynomial
$$P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_0$$ where $n$ is positive integer has non-negative integer coefficients and $P(u)=2017$.
1) Prove that $a_0+a_1+...+a_n\equiv 1\mod 2$.
2) Find the minimum possible value of $a_0+a_1+...+a_n$.
Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$.
[i]Nanang Susyanto, Jogjakarta[/i]
[b]p1.[/b] (a) Show that for every set of three integers, we can find two of them whose average is also an integer.
(b) Show that for every set of $5$ integers, there is a subset of three of them whose average is an integer.
[b]p2.[/b] Let $f(x) = x^2 + ax + b$ and $g(x) = x^2 + cx + d$ be two different quadratic polynomials such that $f(7) + f(11) = g(7) + g(11)$.
(a) Show that $f(9) = g(9)$.
(b) Show that $x = 9$ is the only value of $x$ where $f(x) = g(x)$.
[b]p3.[/b] Consider a rectangle $ABCD$ and points $E$ and $F$ on the sides $BC$ and $CD$, respectively, such that the areas of the triangles $ABE$, $ECF$, and $ADF$ are $11$, $3$, and $40$, respectively. Compute the area of rectangle $ABCD$.
[img]https://cdn.artofproblemsolving.com/attachments/f/0/2b0bb188a4157894b85deb32d73ab0077cd0b7.png[/img]
[b]p4.[/b] How many ways are there to put markers on a $8 \times 8$ checkerboard, with at most one marker per square, such that each of the $8$ rows and each of the $8$ columns contain an odd number of markers?
[b]p5.[/b] A robot places a red hat or a blue hat on each person in a room. Each person can see the colors of the hats of everyone in the room except for his own. Each person tries to guess the color of his hat. No communication is allowed between people and each person guesses at the same time (so no timing information can be used, for example). The only information a person has is the color of each other person’s hat.
Before receiving the hats, the people are allowed to get together and decide on their strategies. One way to think of this is that each of the $n$ people makes a list of all the possible combinations he could see (there are $2^{n-1}$ such combinations). Next to each combination, he writes what his guess will be for the color of his own hat. When the hats are placed, he looks for the combination on his list and makes the guess that is listed there.
(a) Prove that if there are exactly two people in the room, then there is a strategy that guarantees that always at least one person gets the right answer for his hat color.
(b) Prove that if you have a group of $2008$ people, then there is a strategy that guarantees that always at least $1004$ people will make a correct guess.
(c) Prove that if there are $2009$ people, then there is no strategy that guarantees that always at least $1005$ people will make a correct guess.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $f:\mathbb{R} \to \mathbb{R}$ be a monotonic function and $a,b,c,d$ be real numbers with $a$ and $c$ nonzero. Prove that if the equalities [center]$\int\limits_x^{x+\sqrt{3}} f(t) \mathrm{d}t=ax+b$ and $\int\limits_x^{x+\sqrt{2}} f(t) \mathrm{d}t=cx+d$[/center] hold for every real number $x,$ then $f$ is a polynomial function of degree one.
Find all polynomials $P_n(x)$ of the form
$$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\ldots+a_1x+(-1)^nn(n+1),$$with integer coefficients, such that its roots $x_1,x_2,\ldots,x_n$ satisfy $k\le x_k\le k+1$ for $k=1,2,\ldots,n$.
Let $f_1(x)$ be a polynomial of degree $2$ with the leading coefficient positive and $f_{n+1}(x) =f_1(f_n(x))$ for $n\ge 1.$ Prove that if the equation $f_2(x)=0$ has four different non-positive real roots, then for arbitrary $n$ then $f_n(x)$ has $2^n$ different real roots.
Let $f(x)$ be a nonconstant real polynomial. The sequence $\{a_i\}_{i=1}^{\infty}$ of real numbers is strictly increasing and unbounded, as
$$a_{i+1}<a_i+2020.$$
The integers $\lfloor{|f(a_1)|}\rfloor$ , $\lfloor{|f(a_2)|}\rfloor$ , $\lfloor{|f(a_3)|}\rfloor$ , $\dots$ are written consecutively in such a way that their digits form an infinite sequence of digits $\{s_k\}_{k=1}^{\infty}$ (here $s_k\in\{0, 1, \dots, 9\}$).
$\quad$If $n\in\mathbb{N}$ , prove that among the numbers $\overline{s_{n(k-1)+1}s_{n(k-1)+2}\cdots s_{nk}}$ , where $k\in\mathbb{N}$ , all $n$-digit numbers appear.