Found problems: 85335
Solve the equation $$\left| ... \left|\left||x^2-x| -1\right|-1 \right|...-1\right|=x^2-2x-14.$$ (There are $11$ units on the left side.)
A student adds up rational fractions incorrectly:
\[\frac{a}{b}+\frac{x}{y}=\frac{a+x}{b+y}\quad (\star) \]
Despite that, he sometimes obtains correct results. For a given fraction $\frac{a}{b},a,b\in\mathbb{Z},b>0$, find all fractions $\frac{x}{y},x,y\in\mathbb{Z},y>0$ such that the result obtained by $(\star)$ is correct.
$99$ identical balls lie on a table. $50$ balls are made of copper, and $49$ balls are made of zinc. The assistant numbered the balls. Once spectrometer test is applied to $2$ balls and allows to determine whether they are made of the same metal or not. However, the results of the test can be obtained only the next day. What minimum number of tests is required to determine the material of each ball if all the tests should be performed today?
[i]Proposed by N. Vlasova, S. Berlov[/i]
Positive real numbers $a$ and $b$ verify $a^5+b^5=a^3+b^3$. Find the greatest possible value of the expression $E=a^2-ab+b^2$.
There is a unique triple $(a,b,c)$ of two-digit positive integers $a,\,b,$ and $c$ that satisfy the equation $$a^3+3b^3+9c^3=9abc+1.$$ Compute $a+b+c$.
Given an triangle $ABC$ isosceles at the vertex $A$, let $P$ and $Q$ be the touchpoints with $AB$ and $AC$, respectively with the circle $T$, which is tangent to both and is internally tangent to the circumcircle of $ABC$. Let $R$ and $S$ be the points of the circumscribed circle of $ABC$ such that $AP = AR = AS$ . Prove that $RS$ is tangent to $T$ .
Let $ABC$ be an acute scalene triangle and $K$ be a point inside it that belongs to the bisector of the angle $\angle ABC$. Let$ P$ be the point where the line $AK$ intersects the line perpendicular to $AB$ that passes through $B$, and let $Q$ be the point where the line $CK$ intersects the line perpendicular to $CB$ that passes through $B$. Let $L$ be the foot of the perpendicular drawn from $K$ on the line $AC$. Prove that if $P Q$ is perpendicular to $BL$, then $K$ is the incenter of $ABC$.
Your friend sitting to your left (or right?) is unable to solve any of the eight problems on his or her Combinatorics $B$ test, and decides to guess random answers to each of them. To your astonishment, your friend manages to get two of the answers correct. Assuming your friend has equal probability of guessing each of the questions correctly, what is the average possible value of your friend’s score? Recall that each question is worth the point value shown at the beginning of each question.
Find the difference between the greatest and least values of $lcm (a,b,c)$, where $a$, $b$, and $c$ are distinct positive integers between $1$ and $10$, inclusive.
Let $k_1$ and $k_2$ be two circles with centers $O_1$ and $O_2$ and equal radius $r$ such that $O_1O_2 = r$. Let $A$ and $B$ be two points lying on the circle $k_1$ and being symmetric to each other with respect to the line $O_1O_2$. Let $P$ be an arbitrary point on $k_2$. Prove that
\[PA^2 + PB^2 \geq 2r^2.\]
Georg has bought lots of filled chocolates for a party, and when he counts how many he has, he discovers that the number is a prime number. He distributes so many of the chocolates as possible on $60$ trays with an equal number on each. He notes then that he has more than one piece left and that the number left pieces is not a prime number. How many pieces of chocolate does Georg have left?
The angle bisector of $\angle ABC$ of triangle $ABC$ ($AB>BC$) cuts the circumcircle of that triangle in $K$. The foot of the perpendicular from $K$ to $AB$ is $N$, and $P$ is the midpoint of $BN$. The line through $P$ parallel to $BC$ cuts line $BK$ in $T$. Prove that the line $NT$ passes through the midpoint of $AC$.
Let $a$ and $b$ be positive integers such that $2a^2 + a = 3b^2 + b$. Prove that $a-b$ is a perfect square.
The angles of the triangle $\alpha, \beta, \gamma$ satisfy the inequalities $$\sin \alpha > \cos \beta, \sin \beta > \cos \gamma, \sin \gamma > \cos \alpha. $$Prove that the trαiangle is acute-angled.
Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]
For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$ have two distinct integer roots?
$\textbf{(A) }6 \qquad \textbf{(B) }8 \qquad \textbf{(C) }9 \qquad \textbf{(D) }14 \qquad \textbf{(E) }16$
Harry Potter can do any of the three tricks arbitrary number of times:
$i)$ switch $1$ plum and $1$ pear with $2$ apples
$ii)$ switch $1$ pear and $1$ apple with $3$ plums
$iii)$ switch $1$ apple and $1$ plum with $4$ pears
In the beginning, Harry had $2012$ of plums, apples and pears, each. Harry did some tricks and now he has $2012$ apples, $2012$ pears and more than $2012$ plums. What is the minimal number of plums he can have?
There are two airlines A and B and finitely many airports. For each pair of airports, there is exactly one airline among A and B whose flights operates in both directions. Each airline plans to develop world travel packages which pass each airport exactly once using only its flights. Let $a$ and $b$ be the number of possible packages which belongs to A and B respectively. Prove that $a-b$ is a multiple of $4$.
The official statement of the problem has been changed. The above is the form which appeared during the contest. Now the condition 'the number of airports is no less than 4'is attached. Cite the following link.
[url]https://artofproblemsolving.com/community/c6h2923697p26140823[/url]
There is a table with $n > 2$ cells in the first row, $n-1$ cells in the second row is a cell, $n-2$ in the third row, $\ldots$, $1$ cell in the $n$-th row. The cells are arranged as shown below.
[img]https://i.ibb.co/0Z1CR0c/UMO24-8-2.png[/img]
In each cell of the top row Petryk writes a number from $1$ to $n$, so that each number is written exactly once. For each other cell, if the cells directly above it contains numbers $a, b$, it contains number $|a-b|$. What is the largest number that can be written in a single cell of the bottom row?
[i]Proposed by Bogdan Rublov[/i]
Is it true that when all the faces of a tetrahedron have the same area, they are congruent triangles?
A switch has two inputs $1, 2$ and two outputs $1, 2$. It either connects $1$ to $1$ and $2$ to $2$, or $1$ to $2$ and $2$ to 1. If you have three inputs $1, 2, 3$ and three outputs $1, 2, 3$, then you can use three switches, the first across $1$ and $2$, then the second across $2$ and $3$, and finally the third across $1$ and $2$. It is easy to check that this allows the output to be any permutation of the inputs and that at least three switches are required to achieve this. What is the minimum number of switches required for $4$ inputs, so that by suitably setting the switches the output can be any permutation of the inputs?
The corner of a unit cube is chopped off such that the cut runs through the three vertices adjacent to the vertex of the chosen corner. What is the height of the cube when the freshly-cut face is placed on a table?
Among $100$ points in the plane, no three collinear, exactly $4026$ pairs are connected by line segments. Each point is then randomly assigned an integer from $1$ to $100$ inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least $50$.
[i]Proposed by Evan Chen[/i]
All segments joining $n$ points (no three of which are collinear) are coloured in one of $k$ colours. What is the smallest $k$ for which there always exists a closed polygonal line with the vertices at some of the $n$ points, whose sides are all of the same colour?
Let $ ABCD $ be a parallelogram with $ BC = 17 $. Let $ M $ be the midpoint of $ \overline{BC} $ and let $ N $ be the
point such that $ DANM $ is a parallelogram. What is the length of segment $ \overline{NC} $?