Found problems: 4275
Given $n$, let $k = k(n)$ be the minimal degree of any monic integral polynomial
$$f(x)=x^k + a_{k-1}x^{k-1}+\ldots+a_0$$
such that the value of $f(x)$ is exactly divisible by $n$ for every integer $x.$ Find the relationship between $n$ and $k(n)$. In particular, find the value of $k(n)$ corresponding to $n = 10^6.$
A Mediterranean polynomial has only real roots and it is of the form
\[ P(x) = x^{10}-20x^9+135x^8+a_7x^7+a_6x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0 \] with real coefficients $a_0\ldots,a_7$. Determine the largest real number that occurs as a root of some Mediterranean polynomial.
[i](Proposed by Gerhard Woeginger, Austria)[/i]
Find all pairs $ (m, n)$ of positive integers that have the following property:
For every polynomial $P (x)$ of real coefficients and degree $m$, there exists a polynomial $Q (x)$ of real coefficients and degree $n$ such that $Q (P (x))$ is divisible by $Q (x)$.
[b]p1.[/b] Let $A = \{D,U,K,E\}$ and $B = \{M, A, T,H\}$. How many maps are there from $A$ to $B$?
[b]p2.[/b] The product of two positive integers $x$ and $y$ is equal to $3$ more than their sum. Find the sum of all possible $x$.
[b]p3.[/b] There is a bag with $1$ red ball and $1$ blue ball. Jung takes out a ball at random and replaces it with a red ball. Remy then draws a ball at random. Given that Remy drew a red ball, what is the probability that the ball Jung took was red?
[b]p4.[/b] Let $ABCDE$ be a regular pentagon and let $AD$ intersect $BE$ at $P$. Find $\angle APB$.
[b]p5.[/b] It is Justin and his $4\times 4\times 4$ cube again! Now he uses many colors to color all unit-cubes in a way such that two cubes on the same row or column must have different colors. What is the minimum number of colors that Justin needs in order to do so?
[b]p6.[/b] $f(x)$ is a polynomial of degree $3$ where $f(1) = f(2) = f(3) = 4$ and $f(-1) = 52$. Determine $f(0)$.
[b]p7.[/b] Mike and Cassie are partners for the Duke Problem Solving Team and they decide to meet between $1$ pm and $2$ pm. The one who arrives first will wait for the other for $10$ minutes, the lave. Assume they arrive at any time between $1$ pm and $2$ pm with uniform probability. Find the probability they meet.
[b]p8.[/b] The remainder of $2x^3 - 6x^2 + 3x + 5$ divided by $(x - 2)^2$ has the form $ax + b$. Find $ab$.
[b]p9.[/b] Find $m$ such that the decimal representation of m! ends with exactly $99$ zeros.
[b]p10.[/b] Let $1000 \le n = \overline{DUKE} \le 9999$. be a positive integer whose digits $\overline{DUKE}$ satisfy the divisibility condition: $$1111 | \left( \overline{DUKE} + \overline{DU} \times \overline{KE} \right)$$ Determine the smallest possible value of $n$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $x+y=a$ and $xy=b$. The expression $x^6+y^6$ can be written as a polynomial in terms of $a$ and $b$. What is this polynomial?
Suppose that $p$ is the unique monic polynomial of minimal degree such that its coefficients are rational numbers and one of its roots is $\sin \frac{2\pi}{7} + \cos \frac{4\pi}{7}$. If $p(1) = \frac{a}{b}$, where $a, b$ are relatively prime integers, find $|a + b|$.
Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.
i thought that this problem was in mathlinks but when i searched i didn't find it.so here it is:
Find all positive integers m for which for all $\alpha,\beta \in \mathbb{Z}-\{0\}$
\[ \frac{2^m \alpha^m-(\alpha+\beta)^m-(\alpha-\beta)^m}{3 \alpha^2+\beta^2} \in \mathbb{Z} \]
We are given a natural number $d$. Find all open intervals of maximum length $I \subseteq R$ such that for all real numbers $a_0,a_1,...,a_{2d-1}$ inside interval $I$, we have that the polynomial $P(x)=x^{2d}+a_{2d-1}x^{2d-1}+...+a_1x+a_0$ has no real roots.
A polynomial $P(x)$ with real coefficients and degree $2021$ is given. For any real $a$ polynomial $x^{2022}+aP(x)$ has at least one real root.
Find all possible values of $P(0)$
On a blackboard, several polynomials of degree $37$ are written, each of them has the leading coefficient equal to $1$. Initially all coefficients of each polynomial are non-negative. By one move it is allowed to erase any pair of polynomials $f, g$ and replace it by another pair of polynomials $f_1, g_1$ of degree $37$ with the leading coefficients equal to $1$ such that either $f_1+g_1 = f+g$ or $f_1g_1 = fg$. Prove that it is impossible that after some move each polynomial
on the blackboard has $37$ distinct positive roots. [i](8 points)[/i]
[i]Alexandr Kuznetsov[/i]
Let $a, b, c$ be three non-zero integers. It is known that the sums $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}$ and $\frac{b}{a}+\frac{c}{b}+\frac{a}{c}$ are integers. Find these sums.
Let $P(x) = x^2 + ax + b$ be a quadratic polynomial. For how many pairs $(a, b)$ of positive integers where $a, b < 1000$ do the quadratics $P(x+1)$ and $P(x) + 1$ have at least one root in common?
For a polynomial $P(x)$ with integer coefficients and a prime $p$, if there is no $n \in \mathbb{Z}$ such that $p|P(n)$, we say that polynomial $P$ [i]excludes[/i] $p$. Is there a polynomial with integer coefficients such that having degree of 5, excluding exactly one prime and not having a rational root?
[i]The following problem is open in the sense that the answer to part (b) is not currently known. A proof of part (a) will be awarded 5 points. Up to 7 additional points may be awarded for progress on part (b).[/i]
Let $p(x)$ be a polynomial of degree $d$ with coefficients belonging to the set of rational numbers $\mathbb{Q}$. Suppose that, for each $1 \le k \le d-1$, $p(x)$ and its $k$th derivative $p^{(k)}(x)$ have a common root in $\mathbb{Q}$; that is, there exists $r_k \in \mathbb{Q}$ such that $p(r_k) = p^{(k)}(r_k) = 0$.
(a) Prove that if $d$ is prime then there exist constants $a, b, c \in \mathbb{Q}$ such that
\[ p(x) = c(ax + b)^d. \]
(b) For which integers $d \ge 2$ does the conclusion of part (a) hold?
Find all injective functions $f\colon \mathbb{R}^* \to \mathbb{R}^* $ from the non-zero reals to the non-zero reals, such that \[f(x+y) \left(f(x) + f(y)\right) = f(xy)\] for all non-zero reals $x, y$ such that $x+y \neq 0$.
A sequence of polynomials $\{f_n\}_{n=0}^{\infty}$ is defined recursively by $f_0(x)=1$, $f_1(x)=1+x$, and
\[(k+1)f_{k+1}(x)-(x+1)f_k(x)+(x-k)f_{k-1}(x)=0, \quad k=1,2,\ldots\]
Prove that $f_k(k)=2^k$ for all $k\geq 0$.
On the graph of a polynomial with integral coefficients are two points with integral coordinates. Prove that if the distance between these two points is integral, then the segment connecting them is parallel to the $x$-axis.
[i](4 points)[/i]
Let $P(x)$ be a polynomial with real coefficients and form the polynomial
$$Q(x) = ( x^2 +1) P(x)P'(x) + x(P(x)^2 + P'(x)^2 ).$$
Given that the equation $P(x) = 0$ has $n$ distinct real roots exceeding $1$, prove or disprove that the equation
$Q(x)=0$ has at least $2n - 1$ distinct real roots.
Find all polynomials $P(x)$ with real coefficieints such that $P\left(x^2\right)=P(x)P(x-1)$ for all $x\in\mathbb R$.
Let $f$ be a monic cubic polynomial satisfying $f(x) + f(-x) = 0$ for all real numbers $x$. For all real numbers $y$, define $g(y)$ to be the number of distinct real solutions $x$ to the equation $f(f(x)) = y$. Suppose that the set of possible values of $g(y)$ over all real numbers $y$ is exactly $\{1, 5, 9\}$. Compute the sum of all possible values of $f(10)$.
Find out all the integer pairs $(m,n)$ such that there exist two monic polynomials $P(x)$ and $Q(x)$ ,with $\deg{P}=m$ and $\deg{Q}=n$,satisfy that $$P(Q(t))\not=Q(P(t))$$ holds for any real number $t$.
Let $f(x)$ be a quotient of two quadratic polynomials. Given that $f(n) = n^3$ for all $n \in \{1, 2, 3, 4, 5\}$, compute $f(0)$.
Let $a,n$ be integer numbers, $p$ a prime number such that $p>|a|+1$. Prove that the polynomial $f(x)=x^n+ax+p$ cannot be represented as a product of two integer polynomials.
[i]Laurentiu Panaitopol[/i]
Find the smallest positive integer $n$ for which the polynomial \[x^n-x^{n-1}-x^{n-2}-\cdots -x-1\] has a real root greater than $1.999$.
[i]Proposed by James Lin