This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 4275

Let $ a,b,c$ be positive real numbers such that $ a^3 \plus{} b^3 \equal{} c^3$.Prove that: $ a^2 \plus{} b^2 \minus{} c^2 > 6(c \minus{} a)(c \minus{} b)$.
Determine all nonempty finite sets of positive integers $\{a_1, \dots, a_n\}$ such that $a_1 \cdots a_n$ divides $(x + a_1) \cdots (x + a_n)$ for every positive integer $x$. [i]Proposed by Ankan Bhattacharya[/i]
Let $f(x) = x^n+x^{n-1}+\dots+x+1$ for an integer $n\ge 1.$ For which $n$ are there polynomials $g, h$ with real coefficients and degrees smaller than $n$ such that $f(x) = g(h(x)).$
Suppose that $p$ and $q$ are two different positive integers and $x$ is a real number. Form the product $(x+p)(x+q).$ Find the sum $S(x,n) = \sum (x+p)(x+q),$ where $p$ and $q$ take values from 1 to $n.$ Does there exist integer values of $x$ for which $S(x,n) = 0.$
Let $g(x)$ be a polynomial of degree at least $2$ with all of its coefficients positive. Find all functions $f:\mathbb R^+ \longrightarrow \mathbb R^+$ such that \[f(f(x)+g(x)+2y)=f(x)+g(x)+2f(y) \quad \forall x,y\in \mathbb R^+.\] [i]Proposed by Mohammad Jafari[/i]
Let $n \geq 1$ be an integer, and $a_0, a_1, \dots, a_{n-1}$ be real numbers such that \[ 1 \geq a_{n-1} \geq a_{n-2} \geq \dots \geq a_1 \geq a_0 \geq 0. \] We assume that $\lambda$ is a real root of the polynomial \[ x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0. \] Prove that $|\lambda| \leq 1$.
Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.
It is known that $\sin 3x = 3 \sin x - 4 \sin^3x$. It is also easy to prove that $\sin nx$ for odd $n$ can be represented as a polynomial of degree $n$ of $\sin x$. Let $\sin 1999x = P(\sin x)$, where $P(t)$ is a polynomial of the $1999$th degree of $t$. Solve the equation $$P \left(\cos \frac{x}{1999}\right) = \frac12 .$$
[b]p1. [/b] What is the maximum number of $T$-shaped polyominos (shown below) that we can put into a $6 \times 6$ grid without any overlaps. The blocks can be rotated. [img]https://cdn.artofproblemsolving.com/attachments/7/6/468fd9b81e9115a4a98e4cbf6dedf47ce8349e.png[/img] [b]p2.[/b] In triangle $\vartriangle ABC$, $\angle A = 30^o$. $D$ is a point on $AB$ such that $CD \perp AB$. $E$ is a point on $AC$ such that $BE \perp AC$. What is the value of $\frac{DE}{BC}$ ? [b]p3.[/b] Given that f(x) is a polynomial such that $2f(x) + f(1 - x) = x^2$. Find the sum of squares of the coefficients of $f(x)$. [b]p4. [/b] For each positive integer $n$, there exists a unique positive integer an such that $a^2_n \le n < (a_n + 1)^2$. Given that $n = 15m^2$ , where $m$ is a positive integer greater than $1$. Find the minimum possible value of $n - a^2_n$. [b]p5.[/b] What are the last two digits of $\lfloor (\sqrt5 + 2)^{2016}\rfloor$ ? Note $\lfloor x \rfloor$ is the largest integer less or equal to x. [b]p6.[/b] Let $f$ be a function that satisfies $f(2^a3^b)) = 3a+ 5b$. What is the largest value of f over all numbers of the form $n = 2^a3^b$ where $n \le 10000$ and $a, b$ are nonnegative integers. [b]p7.[/b] Find a multiple of $21$ such that it has six more divisors of the form $4m + 1$ than divisors of the form $4n + 3$ where m, n are integers. You can keep the number in its prime factorization form. [b]p8.[/b] Find $$\sum^{100}_{i=0} \lfloor i^{3/2} \rfloor +\sum^{1000}_{j=0} \lfloor j^{2/3} \rfloor$$ where $\lfloor x \rfloor$ is the largest integer less or equal to x. [b]p9. [/b] Let $A, B$ be two randomly chosen subsets of $\{1, 2, . . . 10\}$. What is the probability that one of the two subsets contains the other? [b]p10.[/b] We want to pick $5$-person teams from a total of $m$ people such that: 1. Any two teams must share exactly one member. 2. For every pair of people, there is a team in which they are teammates. How many teams are there? (Hint: $m$ is determined by these conditions). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.
Let $P(x)=x^2-3x-9$. A real number $x$ is chosen at random from the interval $5\leq x \leq 15$. The probability that $\lfloor \sqrt{P(x)} \rfloor = \sqrt{P(\lfloor x \rfloor )}$ is equal to $\dfrac{\sqrt{a}+\sqrt{b}+\sqrt{c}-d}{e}$, where $a,b,c,d$ and $e$ are positive integers and none of $a,b,$ or $c$ is divisible by the square of a prime. Find $a+b+c+d+e$.
Let $a \not = 0, b, c$ be real numbers. If $x_{1}$ is a root of the equation $ax^{2}+bx+c = 0$ and $x_{2}$ a root of $-ax^{2}+bx+c = 0$, show that there is a root $x_{3}$ of $\frac{a}{2}\cdot x^{2}+bx+c = 0$ between $x_{1}$ and $x_{2}$.
Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$ If $M>1$, prove that the polynomial $$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$ has no positive roots.
Find all polynomials $P\in\mathbb{Z}[x]$ such that $$|P(x)-x|\leq x^2+1$$ for all real numbers $x$.
Let $f(x,y,z) = x^2+y^2+z^2+xyz$. Let $p(x,y,z), q(x,y,z)$, $r(x,y,z)$ be polynomials with real coefficients satisfying \[ f(p(x,y,z), q(x,y,z), r(x,y,z)) = f(x,y,z). \] Prove or disprove the assertion that the sequence $p,q,r$ consists of some permutation of $\pm x, \pm y, \pm z$, where the number of minus signs is $0$ or $2.$
Let $P(x)$ be a polynomial with at most $n{}$ real coefficeints. Prove that if $P(x)$ has integer values for $n+1$ consecutive values of the argument, then $P(m)\in\mathbb{Z},\forall m\in\mathbb{Z}.$
Consider $n$ lamps clockwise numbered from $1$ to $n$ on a circle. Let $\xi$ to be a configuration where $0 \le \ell \le n$ random lamps are turned on. A [i]cool procedure[/i] consists in perform, simultaneously, the following operations: for each one of the $\ell$ lamps which are turned on, we verify the number of the lamp; if $i$ is turned on, a [i]signal[/i] of range $i$ is sent by this lamp, and it will be received only by the next $i$ lamps which follow $i$, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed. The example in attachment, for $n=4$, ilustrates a configuration where lamps $2$ and $4$ are initially turned on. Lamp $2$ sends signal only for the lamps $3$ e $4$, while lamp $4$ sends signal for lamps $1$, $2$, $3$ e $4$. Therefore, we verify that lamps $1$ e $2$ received only one signal, while lamps $3$ e $4$ received two signals. Therefore, in the next configuration, lamps $1$ e $4$ will be turned on, while lamps $2$ e $3$ will be turned off. Let $\Psi$ to be the set of all $2^n$ possible configurations, where $0 \le \ell \le n$ random lamps are turned on. We define a function $f: \Psi \rightarrow \Psi$ where, if $\xi$ is a configuration of lamps, then $f(\xi)$ is the configurations obtained after we perform the [i]cool procedure[/i] described above. Determine all values of $n$ for which $f$ is bijective.
For each positive integer $k$, we define the polynomial $S_k(x)=1+x+x^2+x^3+...+x^{k-1}$ Show that $n \choose 1$ $S_1(x) +$ $n \choose 2$ $S_2(x) +$ $n \choose 3$ $S_3(x)+...+$ $n \choose n$ $S_n(x) = 2^{n-1}S_n\left(\frac{1+x}{2}\right)$ for every positive integer $n$ and every real number $x$.
What is the largest integer that must divide $n^5-5n^3+4n$ for all integers $n$? [i]2016 CCA Math Bonanza Lightning #2.4[/i]
Suppose $ P(x) \equal{} a_nx^n\plus{}\cdots\plus{}a_1x\plus{}a_0$ be a real polynomial of degree $ n > 2$ with $ a_n \equal{} 1$, $ a_{n\minus{}1} \equal{} \minus{}n$, $ a_{n\minus{}2} \equal{}\frac{n^2 \minus{} n}{2}$ such that all the roots of $ P$ are real. Determine the coefficients $ a_i$.
Let $p$ be a prime number and $\mathcal{A}$ be a finite set of integers, with at least $p^k$ elements. Denote by $N_{\text{even}}$ the number of subsets of $\mathcal{A}$ with even cardinality and sum of elements divisible by $p^k$. Define $N_{\text{odd}}$ similarly. Prove that $N_{\text{even}}\equiv N_{\text{odd}}\bmod{p}.$
Find all real non-zero polynomials satisfying $P(x)^3+3P(x)^2=P(x^{3})-3P(-x)$ for all $x\in\mathbb{R}$.
A sphere is inscribed in a truncated right circular cone as shown. The volume of the truncated cone is twice that of the sphere. What is the ratio of the radius of the bottom base of the truncated cone to the radius of the top base of the truncated cone? [asy] real r=(3+sqrt(5))/2; real s=sqrt(r); real Brad=r; real brad=1; real Fht = 2*s; import graph3; import solids; currentprojection=orthographic(1,0,.2); currentlight=(10,10,5); revolution sph=sphere((0,0,Fht/2),Fht/2); //draw(surface(sph),green+white+opacity(0.5)); //triple f(pair t) {return (t.x*cos(t.y),t.x*sin(t.y),t.x^(1/n)*sin(t.y/n));} triple f(pair t) { triple v0 = Brad*(cos(t.x),sin(t.x),0); triple v1 = brad*(cos(t.x),sin(t.x),0)+(0,0,Fht); return (v0 + t.y*(v1-v0)); } triple g(pair t) { return (t.y*cos(t.x),t.y*sin(t.x),0); } surface sback=surface(f,(3pi/4,0),(7pi/4,1),80,2); surface sfront=surface(f,(7pi/4,0),(11pi/4,1),80,2); surface base = surface(g,(0,0),(2pi,Brad),80,2); draw(sback,rgb(0,1,0)); draw(sfront,rgb(.3,1,.3)); draw(base,rgb(.4,1,.4)); draw(surface(sph),rgb(.3,1,.3)); [/asy] $ \textbf {(A) } \dfrac {3}{2} \qquad \textbf {(B) } \dfrac {1+\sqrt{5}}{2} \qquad \textbf {(C) } \sqrt{3} \qquad \textbf {(D) } 2 \qquad \textbf {(E) } \dfrac {3+\sqrt{5}}{2} $