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: 85335

Let $n\ge 2$ be a given integer. Determine all sequences $x_1,...,x_n$ of positive rational numbers such that $x_1^{x_2}=x_2^{x_3}=...=x_{n-1}^{x_n}=x_n^{x_1}$
On $\triangle ABC$ if there existed a point $D$ in $AC$ such that $\angle CBD=\angle ABD+60$ and $\angle BDC=30$ and $AB \cdot BC=BD^2$, then find the angles inside the triangle $\triangle ABC$
Triangle $ ABC$ obeys $ AB = 2AC$ and $ \angle{BAC} = 120^{\circ}.$ Points $ P$ and $ Q$ lie on segment $ BC$ such that \begin{eqnarray*} AB^2 + BC \cdot CP = BC^2 \\ 3AC^2 + 2BC \cdot CQ = BC^2 \end{eqnarray*} Find $ \angle{PAQ}$ in degrees.
Find all functions $f:\mathbb{R}^+ \to \mathbb{R}^+$ and plynomials $P(x),Q(x),R(x)$ with positive real coefficients such that $Q(-1)=-1$ and for all positive reals $x,y$:$$f(\frac{x}{y}+R(y))=\frac{f(x)}{Q(y)}+P(y).$$ [i]Proposed by Alireza Danaie, Ali Mirazaie Anari[/i] [b]Rated 2[/b]
Let $P_1P_2P_3P_4$ be a tetrahedron in $\mathbb{R}^3$ and let $O$ be a point equidistant from each of its vertices. Suppose there exists a point $H$ such that for each $i$, the line $P_iH$ is perpendicular to the plane through the other three vertices. Line $P_1H$ intersects the plane through $P_2, P_3, P_4$ at $A$, and contains a point $B\neq P_1$ such that $OP_1=OB$. Show that $HB=3HA$. [i]Michael Ren[/i]
Let $S$ be a nonempty closed set in the euclidean plane for which there is a closed disk $D$ containing $S$ such that $D$ is a subset of every closed disk that contains $S$. Prove that every point inside $D$ is the midpoint of a segment joining two points of $S.$
Construct the midpoint of a segment using an unmarked ruler and a [i]trisector[/i] that marks in a segment the two points that divide the segment in three equal parts.
* On a plane, given points $A, B, C$ and angles $\angle D, \angle E, \angle F$ each less than $180^o$ and the sum equal to $360^o$, construct with the help of ruler and protractor a point $O$ such that $\angle AOB = \angle D, \angle BOC = \angle E$ and $\angle COA = \angle F.$
Let $p$ and $q$ be two distinct integers. The square trinomial $x^2 + px + q$ is written on the board. At each step, a number is deleted: or the coefficient next to $x$, or the free term, and instead of the deleted number, a number is written, which is obtained from the deleted number by adding or subtracting the number $1$. After several such steps on the board, the square trinomial $x^2 + qx + p$ appeared. Show that at one stage a square trinomial was written on the board, both roots of which are integers.
Define the binary operation $a\Delta b=ab+a-1$. Compute \[ 10 \Delta(10 \Delta (10 \Delta (10 \Delta (10 \Delta (10 \Delta (10 \Delta (10 \Delta (10 \Delta 10)))))))) \] where $10$ is written $10$ times. [i]2020 CCA Math Bonanza Individual Round #7[/i]
Find all quadruples of positive integers $(a,b,c,d)$ such that $a+b=cd$ and $c+d=ab$.
Let $ABCD$ be a rectangle with $P$ lies on the segment $AC$. Denote $Q$ as a point on minor arc $PB$ of $(PAB)$ such that $QB = QC$. Denote $R$ as a point on minor arc $PD$ of $(PAD)$ such that $RC = RD$. The lines $CB$, $CD$ meet $(CQR)$ again at $M, N$ respectively. Prove that $BM = DN$. by Tran Quang Hung
Find, with proof, all positive integers $n$ for which $2^n + 12^n + 2011^n$ is a perfect square.
Let $m$, $n$ be two positive integers greater than 3. Consider the table of size $m\times n$ ($m$ rows and $n$ columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions: $-$ each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click [url=http://www.mathlinks.ro/Forum/download.php?id=4425]here[/url] to view the pictures). In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same? a) $m=2004$, $n=2006$; b) $m=2005$, $n=2006$.
Prove that there do not exist polynomials $ P$ and $ Q$ such that \[ \pi(x)\equal{}\frac{P(x)}{Q(x)}\] for all $ x\in\mathbb{N}$.
Find all polynomials $P$ with integer coefficients such that $$s(x)=s(y) \implies s(|P(x)|)=s(|P(y)|).$$ for all $x,y\in \mathbb{N}$. Note: $s(x)$ denotes the sum of digits of $x$. [i]Proposed by Şevket Onur YILMAZ[/i]
Given a triangle $ABC$, let the bisector of $\angle BAC$ meets the side $BC$ and circumcircle of triangle $ABC$ at $D$ and $E$, respectively. Let $M$ and $N$ be the midpoints of $BD$ and $CE$, respectively. Circumcircle of triangle $ABD$ meets $AN$ at $Q$. Circle passing through $A$ that is tangent to $BC$ at $D$ meets line $AM$ and side $AC$ respectively at $P$ and $R$. Show that the four points $B,P,Q,R$ lie on the same line. [i]Proposer: Fajar Yuliawan[/i]
How many two-digit numbers have digits whose sum is a perfect square? $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 16 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 18 \qquad \textbf{(E)}\ 19$
Find for which natural numbers $ n\ge 2 $ there exist two real matrices $ A,B $ of order $ n $ that satisy the property: $$ (AB)^2=0\neq (BA)^2 $$ [i]Dan Bărbosu[/i]
A square grid $100 \times 100$ is tiled in two ways - only with dominoes and only with squares $2 \times 2$. What is the least number of dominoes that are entirely inside some square $2 \times 2$?
Let $S$ be a set of $n\ge2$ positive integers. Prove that there exist at least $n^2$ integers that can be written in the form $x+yz$ with $x,y,z\in S$. [i]Proposed by Gerhard Woeginger, Austria[/i]
Determine a quadric polynomial with intergral coefficients whose roots are $\cos 72^{\circ}$ and $\cos 144^{\circ}.$
Prove that the system of equations $\begin{cases} x_1 - x_2 = a \\ x_3 - x_4 = b \\ x_1 + x_2 + x_3 + x_4 = 1\end{cases}$ has at least one solution in positive numbers ($x_1 ,x_2 ,x_3 ,x_4>0$) if and only if $|a| + |b| < 1$.
Determine all triples of real numbers $(x, y, z)$ which satisfy the following system of equations: \[ \begin{cases} x+y+z=0 \\ x^3+y^3+z^3 = 90 \\ x^5+y^5+z^5=2850. \end{cases} \]
Given two heaps of checkers. the bigger contains $m$ checkers, the smaller -- $n$ ($m>n$). Two players are taking checkers in turn from the arbitrary heap. The players are allowed to take from the heap a number of checkers (not zero) divisible by the number of checkers in another heap. The player that takes the last checker in any heap wins. a) Prove that if $m > 2n$, than the first can always win. b) Find all $x$ such that if $m > xn$, than the first can always win.