Find all integer polynomials $P(x)$, the highest coefficent is 1 such that: there exist infinitely irrational numbers $a$ such that $p(a)$ is a positive integer.

For a real number $x$ let $\lfloor x\rfloor$ be the greatest integer less than or equal to $x$ and let $\{x\} = x - \lfloor x\rfloor$. If $a, b, c$ are distinct real numbers, prove that \[\frac{a^3}{(a-b)(a-c)}+\frac{b^3}{(b-a)(b-c)}+\frac{c^3}{(c-a)(c-b)}\] is an integer if and only if $\{a\} + \{b\} + \{c\}$ is an integer.

$n\geq 3$ is a integer. $\alpha,\beta,\gamma \in (0,1)$. For every $a_k,b_k,c_k\geq0(k=1,2,\dotsc,n)$ with $\sum\limits_{k=1}^n(k+\alpha)a_k\leq \alpha, \sum\limits_{k=1}^n(k+\beta)b_k\leq \beta, \sum\limits_{k=1}^n(k+\gamma)c_k\leq \gamma$, we always have $\sum\limits_{k=1}^n(k+\lambda)a_kb_kc_k\leq \lambda$. Find the minimum of $\lambda$

Let $n>r\geqslant 3$ be two integers and $d$ be a positive integer such that $nd\geqslant \dbinom{n+r}{r+1}$. Show that \[(n-t)(d-t)>\dbinom{n-t+r}{r+1},\] for $t=1,2,\ldots,n-1$ [i]Vasile Brânzănescu[/i]

Find all positive integers $n$ for which the following statement holds: For any two polynomials $P(x)$ and $Q(x)$ of degree $n$ there exist monomials $ax^k$ and $bx^{ell}, 0 \le k,\ ell \le n$, such that the graphs of $P(x) + ax^k$ and $Q(x) + bx^{ell}$ have no common points.

Given $16$ distinct real numbers $\alpha_1,\alpha_2,...,\alpha_{16}$. For each polynomial $P$, denote \[ V(P)=P(\alpha_1)+P(\alpha_2)+...+P(\alpha_{16}). \] Prove that there is a monic polynomial $Q$, $\deg Q=8$ satisfying: i) $V(QP)=0$ for all polynomial $P$ has $\deg P<8$. ii) $Q$ has $8$ real roots (including multiplicity).

Let $a$ be a real number. Find the number of functions $f:\mathbb{R}\rightarrow \mathbb{R}$ depending on $a$, such that $f(xy+f(y))=f(x)y+a$ holds for every $x, y\in \mathbb{R}$.

Find $3$ numbers, each of which is equal to the square of the difference of the other two.

Let $r_1=2$ and $r_n = \prod^{n-1}_{k=1} r_i + 1$, $n \geq 2.$ Prove that among all sets of positive integers such that $\sum^{n}_{k=1} \frac{1}{a_i} < 1,$ the partial sequences $r_1,r_2, ... , r_n$ are the one that gets nearer to 1.

Consider all cubic polynomials $f(x)$ such that $f(2018)=2018$, the graph of $f$ intersects the $y$-axis at height $2018$, the coefficients of $f$ sum to $2018$, and $f(2019)>(2018)$. We define the infinimum of a set $S$ as follows. Let $L$ be the set of lower bounds of $S$. That is, $\ell\in L$ if and only if for all $s\in S$, $\ell\leq s$. Then the infinimum of $S$ is $\max(L)$. Of all such $f(x)$, what is the infinimum of the leading coefficient (the coefficient of the $x^3$ term)?

Let $\{a_n\}_{n \geq 1}$ be a sequence in which $a_1=1$ and $a_2=2$ and \[a_{n+1}=1+a_1a_2a_3 \cdots a_{n-1}+(a_1a_2a_3 \cdots a_{n-1} )^2 \qquad \forall n \geq 2.\] Prove that \[\lim_{n \to \infty} \biggl( \frac{1}{a_1}+\frac{1}{a_2}+\frac{1}{a_3}+\cdots + \frac{1}{a_n} \biggr) =2\]

Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that \[2^{j-i}x_ix_j>2^{s-3}.\]

Let $a,\,b,$ and $c$ be real numbers such that $a+b+c=\frac1{a}+\frac1{b}+\frac1{c}$ and $abc=5$. The value of $$\left(a-\frac1{b}\right)^3+\left(b-\frac1{c}\right)^3+\left(c-\frac1{a}\right)^3$$ can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.

Consider the matrices $A\in \mathcal{M}_{m,n}(\mathbb{C})$ and $B\in \mathcal{M}_{n,m}(\mathbb{C})$ with $n\le m$. It is given that $\text{rank}(AB)=n$ and $(AB)^2=AB$. a)Prove that $(BA)^3=(BA)^2$. b)Find $BA$.

[b]p1.[/b] In the picture below, the two parallel cuts divide the square into three pieces of equal area. The distance between the two parallel cuts is $d$. The square has length $s$. Find and prove a formula that expresses $s$ as a function of $d$. [img]https://cdn.artofproblemsolving.com/attachments/c/b/666074d28de50cdbf338a2c667f88feba6b20c.png[/img] [b]p2.[/b] Let $S$ be a subset of $\{1, 2, 3, . . . 10, 11\}$. We say that $S$ is lucky if no two elements of $S$ differ by $4$ or $7$. (a) Give an example of a lucky set with five elements. (b) Is it possible to find a lucky set with six elements? Explain why or why not.[/quote] [b]p3.[/b] Find polynomials $p(x)$ and $q(x)$ with real coefficients such that (a) $p(x) - q(x) = x^3 + x^2 - x - 1$ for all real $x$, (b) $p(x) > 0$ for all real $x$, (c) $q(x) > 0$ for all real $x$. [b]p4.[/b] A permutation on $\{1, 2, 3, …, n\}$ is a rearrangement of the symbols. For example $32154$ is a permutation on $\{1, 2, 3, 4, 5\}$. Given a permutation $a_1a_2a_3…a_n$, an inversion is a pair of $a_i$ and $a_j$ such that $a_i > a_j$ but $i < j$. For example, $32154$ has $4$ inversions. Suppose you are only allowed to exchange adjacent symbols. For any permutation, show that the minimum number of exchanges required to put all the symbols in their natural positions (that is, $123 …n$) is the number of inversions. [b]p5.[/b] We say a number $N$ is a nontrivial sum of consecutive positive integers if it can be written as the sum of $2$ or more consecutive positive integers. What is the set of numbers from $1000$ to $2000$ that are NOT nontrivial sums of consecutive positive integers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Real numbers $x, y$ satisfy the inequality $x^2 + y^2 \le 2$. Orove that $xy + 3 \ge 2x + 2y$

Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying \[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\] Prove that $P(1983) = F_{1983} - 1.$

A prime $p$ has decimal digits $p_{n}p_{n-1} \cdots p_0$ with $p_{n}>1$. Show that the polynomial $p_{n}x^{n} + p_{n-1}x^{n-1}+\cdots+ p_{1}x + p_0$ cannot be represented as a product of two nonconstant polynomials with integer coefficients

Let $ABC$ be a triangle with $AB = 5$, $BC = 4$, and $CA = 3$. Initially, there is an ant at each vertex. The ants start walking at a rate of $1$ unit per second, in the direction $A \to B \to C \to A$ (so the ant starting at $A$ moves along ray $\overrightarrow{AB}$, etc.). For a positive real number $t$ less than$ 3$, let $A(t)$ be the area of the triangle whose vertices are the positions of the ants after $t$ seconds have elapsed. For what positive real number $t$ less than $3$ is $A(t)$ minimized?

The football tournament was played in one round. $3$ points were given for a win, $1$ point for a draw, and $0$ points for a loss. Could it be that the first place team under the old scoring system (win - $2$ points, draw - $1$ point, loss - $0$) would be last?

The coefficient of $x^7$ in the polynomial expansion of \[ (1+2x-x^2)^4 \] is $ \textbf{(A)}\ -8 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ -12 \qquad\textbf{(E)}\ \text{none of these} $

Find the value of real parameter $ a$ such that $ 2$ is the smallest integer solution of \[ \frac{x\plus{}\log_2 (2^x\minus{}3a)}{1\plus{}\log_2 a} >2.\]

Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$

Let $\, |U|, \, \sigma(U) \,$ and $\, \pi(U) \,$ denote the number of elements, the sum, and the product, respectively, of a finite set $\, U \,$ of positive integers. (If $\, U \,$ is the empty set, $\, |U| = 0, \, \sigma(U) = 0, \, \pi(U) = 1$.) Let $\, S \,$ be a finite set of positive integers. As usual, let $\, \binom{n}{k} \,$ denote $\, n! \over k! \, (n-k)!$. Prove that \[ \sum_{U \subseteq S} (-1)^{|U|} \binom{m - \sigma(U)}{|S|} = \pi(S) \] for all integers $\, m \geq \sigma(S)$.

Find all functions$ f, g : (0,\infty) \to (0,\infty)$ such that for all $x > 0$ we have the relations: $f(g(x)) = \frac{x}{xf(x) - 2}$ and $g(f(x)) = \frac{x}{xg(x) - 2}$ .