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 $a < b < c < d$ be real numbers and $(x,y, z,t)$ be any permutation of $a$,$b$, $c$ and $d$. What are the maximum and minimum values of the expression $$(x - y)^2 + (y- z)^2 + (z - t)^2 + (t - x)^2?$$
A square with sides of length $1$ cm is given. There are many different ways to cut the square into four rectangles. Let $S$ be the sum of the four rectangles’ perimeters. Describe all possible values of $S$ with justification.
Octagon $A_1A_2A_3A_4A_5A_6A_7A_8$ is inscribed in a circle $\Omega$ with center $O$. It is known that $A_1A_2\|A_5A_6$, $A_3A_4\|A_7A_8$ and $A_2A_3\|A_5A_8$. The circle $\omega_{12}$ passes through $A_1$, $A_2$ and touches $A_1A_6$; circle $\omega_{34}$ passes through $A_3$, $A_4$ and touches $A_3A_8$; the circle $\omega_{56}$ passes through $A_5$, $A_6$ and touches $A_5A_2$; the circle $\omega_{78}$ passes through $A_7$, $A_8$ and touches $A_7A_4$. The common external tangent to $\omega_{12}$ and $\omega_{34}$ cross the line passing through ${A_1A_6}\cap{A_3A_8}$ and ${A_5A_2}\cap{A_7A_4}$ at the point $X$. Prove that one of the common tangents to $\omega_{56}$ and $\omega_{78}$ passes through $X$.
A circle can be drawn around the quadrilateral $ABCD$. Let straight lines $AB$ and $CD$ intersect at point $M$, and straight lines $BC$ and $AD$ intersect at point $K$. (Points $B$ and $P$ lie on segments $AM$ and $AK$, respectively.) Let $P$ be the projection of point $M$ onto straight line $AK$, $L$ be the projection of point $K$ on the straight line $AM$. Prove that the straight line $LP$ divides the diagonal $BD$ in half.
Construct a triangle $ABC$ if $AC=b$, $AB=c$ and $\angle AMB=w$, where $M$ is the midpoint of the segment $BC$ and $w<90$. Prove that a solution exists if and only if \[ b \tan{\dfrac{w}{2}} \leq c <b \] In what case does the equality hold?
As shown in the figure below, six semicircles lie in the interior of a regular hexagon with side length $2$ so that the diameters of the semicircles coincide with the sides of the hexagon. What is the area of the shaded region—inside the hexagon but outside all of the semicircles? [asy] size(140); fill((1,0)--(3,0)--(4,sqrt(3))--(3,2sqrt(3))--(1,2sqrt(3))--(0,sqrt(3))--cycle,gray(0.4)); fill(arc((2,0),1,180,0)--(2,0)--cycle,white); fill(arc((3.5,sqrt(3)/2),1,60,240)--(3.5,sqrt(3)/2)--cycle,white); fill(arc((3.5,3sqrt(3)/2),1,120,300)--(3.5,3sqrt(3)/2)--cycle,white); fill(arc((2,2sqrt(3)),1,180,360)--(2,2sqrt(3))--cycle,white); fill(arc((0.5,3sqrt(3)/2),1,240,420)--(0.5,3sqrt(3)/2)--cycle,white); fill(arc((0.5,sqrt(3)/2),1,300,480)--(0.5,sqrt(3)/2)--cycle,white); draw((1,0)--(3,0)--(4,sqrt(3))--(3,2sqrt(3))--(1,2sqrt(3))--(0,sqrt(3))--(1,0)); draw(arc((2,0),1,180,0)--(2,0)--cycle); draw(arc((3.5,sqrt(3)/2),1,60,240)--(3.5,sqrt(3)/2)--cycle); draw(arc((3.5,3sqrt(3)/2),1,120,300)--(3.5,3sqrt(3)/2)--cycle); draw(arc((2,2sqrt(3)),1,180,360)--(2,2sqrt(3))--cycle); draw(arc((0.5,3sqrt(3)/2),1,240,420)--(0.5,3sqrt(3)/2)--cycle); draw(arc((0.5,sqrt(3)/2),1,300,480)--(0.5,sqrt(3)/2)--cycle); label("$2$",(3.5,3sqrt(3)/2),NE); [/asy] $\textbf{(A)}\ 6\sqrt3-3\pi \qquad\textbf{(B)}\ \frac{9\sqrt3}{2}-2\pi \qquad\textbf{(C)}\ \frac{3\sqrt3}{2}-\frac{\pi}{3} \qquad\textbf{(D)}\ 3\sqrt3-\pi \\ \qquad\textbf{(E)}\ \frac{9\sqrt3}{2}-\pi$
Let $n$ be a composite number and $a_1,a_2… a_k\in \mathbb{N}$ are the numbers smaller than $n$ and not coprime with it (in this case $k=n-\phi (n)$). Let $b_1,b_2…b_k$ be a permutation of $a_1,a_2… a_k$ Prove that there exist indexes $i$ and $j$, $i\neq j$ for which $a_i b_i\equiv a_j b_j (mod $ $n)$.
Let $ABCD$ be a cyclic quadrilateral such that the triangles $BCD$ and $CDA$ are not equilateral. Prove that if the Simson line of $A$ with respect to $\triangle BCD$ is perpendicular to the Euler line of $BCD$, then the Simson line of $B$ with respect to $\triangle ACD$ is perpendicular to the Euler line of $\triangle ACD$.
Let $\Gamma$ be circumscribed circle of triangle $ABC $ $(AB \neq AC)$. Let $O$ be circumcenter of the triangle $ABC$. Let $M$ be a point where angle bisector of angle $BAC$ intersects $\Gamma$. Let $D$ $(D \neq M)$ be a point where circumscribed circle of the triangle $BOM$ intersects line segment $AM$ and let $E$ $(E \neq M)$ be a point where circumscribed circle of triangle $COM$ intersects line segment $AM$. Prove that $BD+CE=AM$.
It is known about real $a$ and $b$ that the inequality $$a \cos x + b \cos (3x) > 1$$ has no real solutions. Prove that $|b|\le 1$.
a) Prove that it is possible to choose one number out of any 39 consecutive positive integers, having the sum of its digits divisible by 11; b) Find the first 38 consecutive positive integers none of which have the sum of its digits divisible by 11.
Anna and Berta play a game in which they take turns in removing marbles from a table. Anna takes the first turn. When at the beginning of the turn there are $n\geq 1$ marbles on the table, then the player whose turn it is removes $k$ marbles, where $k\geq 1$ either is an even number with $k\leq \frac{n}{2}$ or an odd number with $\frac{n}{2}\leq k\leq n$. A player win the game if she removes the last marble from the table. Determine the smallest number $N\geq 100000$ such that Berta can enforce a victory if there are exactly $N$ marbles on the tale in the beginning.
Let $ABC$ be an isosceles triangle with $AC=BC$. Let $N$ be a point inside the triangle such that $2 \angle ANB = 180 ^\circ + \angle ACB $. Let $ D $ be the intersection of the line $BN$ and the line parallel to $AN$ that passes through $C$. Let $P$ be the intersection of the angle bisectors of the angles $CAN$ and $ABN$. Show that the lines $DP$ and $AN$ are perpendicular.
Prove that there exists a sequence of positive integers $a_1,a_2,a_3, ...$ such that $a_1^2+a_2^2+...+a_n^2$ is a perfect square for all positive integers $n$.
For a convex hexagon $ ABCDEF$ in which each pair of opposite sides is unequal, consider the following statements. ($ a_1$) $ AB$ is parallel to $ DE$. ($ a_2$)$ AE \equal{} BD$. ($ b_1$) $ BC$ is parallel to $ EF$. ($ b_2$)$ BF \equal{} CE$. ($ c_1$) $ CD$ is parallel to $ FA$. ($ c_2$) $ CA \equal{} DF$. $ (a)$ Show that if all six of these statements are true then the hexagon is cyclic. $ (b)$ Prove that, in fact, five of the six statements suffice.
Determine all pairs $(a, b)$ of positive integers for which $\frac{a^2b+b}{ab^2+9}$ is an integer number.
Consider a triangle $\vartriangle ABC$ with $AB = 7$, $BC = 8$, $CA = 9$, and area $12\sqrt5$. We draw squares on each sides, namely $BCD_2D_1$, $CAE_2E_1$ and $ABF_2F_1$, so that the interiors of the squares do not intersect the interior of the triangle. What is the area of $\vartriangle D_2E_2F_2$?
An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.
Each point of the plane with two integer coordinates is the center of a disk with radius $ \frac {1} {1000}$. Prove that there exists an equilateral triangle whose vertices belong to distinct disks. Prove that such a triangle has side-length greater than 96.
Anna, Ben and Chris sit at the round table passing and eating nuts. At first only Anna has the nuts that she divides equally between Ben and Chris, eating a leftover (if there is any). Then Ben does the same with his pile. Then Chris does the same with his pile. The process repeats itself: each of the children divides his/her pile of nuts equally between his/her neighbours eating the leftovers if there are any. Initially, the number of nuts is large enough (more than 3). Prove that a) at least one nut is eaten; [i](3 points)[/i] b) all nuts cannot be eaten. [i](3 points)[/i]
Let $A$ be a commutative ring with $0 \neq 1$ such that for any $x \in A \setminus \{0\}$ there exist positive integers $m,n$ such that $(x^m+1)^n=x.$ Prove that any endomorphism of $A$ is an automorphism.
Let $ABCD$ be a cyclic quadrilateral with center $O$ such that $BD$ bisects $AC.$ Suppose that the angle bisector of $\angle ABC$ intersects the angle bisector of $\angle ADC$ at a single point $X$ different than $B$ and $D.$ Prove that the line passing through the circumcenters of triangles $XAC$ and $XBD$ bisects the segment $OX.$ [i]Proposed by Viktor Ahmeti and Leart Ajvazaj, Kosovo[/i]
Each term of an infinite sequence $a_1 ,a_2 ,a_3 , \dots$ is equal to 0 or 1. For each positive integer $n$, $$a_n + a_{n+1} \neq a_{n+2} + a_{n+3},\, \text{and}$$ $$a_n + a_{n+1} + a_{n+2} \neq a_{n+3} + a_{n+4} + a_{n+5}.$$ Prove that if $a_1 = 0$, then $a_{2020} = 1$.
Prove that for natural number $n$ it's possible to find complex numbers $\omega_1,\omega_2,\cdots,\omega_n$ on the unit circle that $$\left\lvert\sum_{j=1}^{n}\omega_j\right\rvert=\left\lvert\sum_{j=1}^{n}\omega_j^2\right\rvert=n-1$$ iff $n=2$ occurs.
Prove that there exists a [i]unique[/i] function $f$ from the set $\mathrm{R}^+$ of positive real numbers to $\mathrm{R}^+$ such that\[ f(f(x)) = 6x-f(x) \]and\[ f(x)>0 \]for all $x>0$.