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

Points $M$ and $N$ are marked on the straight line containing the side $AC$ of triangle $ABC$ so that $MA = AB$ and $NC = CB$ (the order of the points on the line: $M, A, C, N$). Prove that the center of the circle inscribed in triangle $ABC$ lies on the common chord of the circles circumscribed around triangles $MCB$ and $NAB$ .
$2020$ magicians are divided into groups of $2$ for the Lexington Magic Tournament. After every $5$ days, which is the duration of one match, teams are rearranged so no $2$ people are ever on the same team. If the longest tournament is $n$ days long, what is the value of $n?$ [i]Proposed by Ephram Chun[/i]
A quadruplet of distinct positive integers $(a, b, c, d)$ is called $k$-good if the following conditions hold: 1. Among $a, b, c, d$, no three form an arithmetic progression. 2. Among $a+b, a+c, a+d, b+c, b+d, c+d$, there are $k$ of them, forming an arithmetic progression. $a)$ Find a $4$-good quadruplet. $b)$ What is the maximal $k$, such that there is a $k$-good quadruplet?
Initially, the numbers $1, 2, \dots, 2024$ are written on a blackboard. Trixi and Nana play a game, taking alternate turns. Trixi plays first. The player whose turn it is chooses two numbers $a$ and $b$, erases both, and writes their (possibly negative) difference $a-b$ on the blackboard. This is repeated until only one number remains on the blackboard after $2023$ moves. Trixi wins if this number is divisible by $3$, otherwise Nana wins. Which of the two has a winning strategy? [i](Birgit Vera Schmidt)[/i]
A nonnegative real number is written at every cube's vertex. The sum of those numbers equals to $1$. Two players choose in turn faces of the cube, but they cannot choose the face parallel to already chosen one (the first moves twice, the second -- once). Prove that the first player can provide the number, at the common for three chosen faces vertex, to be not greater than $1/6$.
Which one of the following bar graphs could represent the data from the circle graph? [asy] unitsize(36); draw(circle((0,0),1),gray); fill((0,0)--arc((0,0),(0,-1),(1,0))--cycle,gray); fill((0,0)--arc((0,0),(1,0),(0,1))--cycle,black); [/asy] [asy] unitsize(4); fill((1,0)--(1,15)--(5,15)--(5,0)--cycle,gray); fill((6,0)--(6,15)--(10,15)--(10,0)--cycle,black); draw((11,0)--(11,20)--(15,20)--(15,0)); fill((26,0)--(26,15)--(30,15)--(30,0)--cycle,gray); fill((31,0)--(31,15)--(35,15)--(35,0)--cycle,black); draw((36,0)--(36,15)--(40,15)--(40,0)); fill((51,0)--(51,10)--(55,10)--(55,0)--cycle,gray); fill((56,0)--(56,10)--(60,10)--(60,0)--cycle,black); draw((61,0)--(61,20)--(65,20)--(65,0)); fill((76,0)--(76,10)--(80,10)--(80,0)--cycle,gray); fill((81,0)--(81,15)--(85,15)--(85,0)--cycle,black); draw((86,0)--(86,20)--(90,20)--(90,0)); fill((101,0)--(101,15)--(105,15)--(105,0)--cycle,gray); fill((106,0)--(106,10)--(110,10)--(110,0)--cycle,black); draw((111,0)--(111,20)--(115,20)--(115,0)); for(int a = 0; a < 5; ++a) { draw((25*a,21)--(25*a,0)--(25*a+16,0)); } label("(A)",(8,21),N); label("(B)",(33,21),N); label("(C)",(58,21),N); label("(D)",(83,21),N); label("(E)",(108,21),N); [/asy]
There are many of the same regular triangles. At the vertices of each of them, the numbers $1, 2, 3$ are written in random order. The triangles were superimposed on one another and found the sum of the numbers that fell into each of the three corners of the stack. Could it be that in each corner the sum is equal to: a) $25$, b) $50$?
The positive integers $a,b,c$ are pairwise relatively prime, $a$ and $c$ are odd and the numbers satisfy the equation $a^2+b^2=c^2$. Prove that $b+c$ is the square of an integer.
Find the number of ordered pairs $(x,y)$, where $x$ and $y$ are both integers between $1$ and $9$, inclusive, such that the product $x\times y$ ends in the digit $5$. [i]Proposed by Andrew Wen[/i]
The total area of all the faces of a rectangular solid is $22 \text{cm}^2$, and the total length of all its edges is $24 \text{cm}$. Then the length in $\text{cm}$ of any one of its internal diagonal is A. $\sqrt{11}$ B. $\sqrt{12}$ C. $\sqrt{13}$ D. $\sqrt{14}$ E. Not uniquely determined
Two disjoint circles $W_1(S_1,r_1)$ and $W_2(S_2,r_2)$ are given in the plane. Point $A$ is on circle $W_1$ and $AB,AC$ touch the circle $W_2$ at $B,C$ respectively. Find the loci of the incenter and orthocenter of triangle $ABC$.
Given a pyramid with square base $ ABCD $ and vertex $ S $. Find the shortest path whose starting and ending point is the point $ S $ and which passes through all the vertices of the base.
A soccer coach named $C$ does a header drill with two players $A$ and $B$, but they all forgot to put sunscreen on their foreheads. They solve this issue by dunking the ball into a vat of sunscreen before starting the drill. Coach $C$ heads the ball to $A$, who heads the ball back to $C$, who then heads the ball to $B$, who heads the ball back to $C$; this pattern $CACBCACB\ldots\,$ repeats ad infinitum. Each time a person heads the ball, $1/10$ of the sunscreen left on the ball ends up on the person's forehead. In the limit, what fraction of the sunscreen originally on the ball will end up on the coach's forehead?
Non-zero real numbers $a, b$ and $c$ are given such that $ab+bc+ac=0$. Prove that numbers $a+b+c$ and $\dfrac{1}{a+b}+\dfrac{1}{b+c}+\dfrac{1}{a+c}$ are either both positive or both negative. [i]Proposed by Mykhailo Shtandenko[/i]
$\sqrt{3+2\sqrt{2}}-\sqrt{3-2\sqrt{2}}$ is equal to $\textbf{(A) }2\qquad\textbf{(B) }2\sqrt{3}\qquad\textbf{(C) }4\sqrt{2}\qquad\textbf{(D) }\sqrt{6}\qquad \textbf{(E) }2\sqrt{2}$
Let $ABC$ be a triangle with sides $AB=19$, $BC=21$, and $AC=20$. Let $\omega$ be the incircle of $ABC$ with center $I$. Extend $BI$ so that it intersects $AC$ at $E$. If $\omega$ is tangent to $AC$ at the point $D$, then compute the length of $DE$.
Prove that for any triangle $ABC$, the inequality $\displaystyle\sum_{\text{cyclic}}\cos A\le\sum_{\text{cyclic}}\sin (A/2)$ holds.
Let $p > 1$ be relatively prime to $10$. Let $n$ be any positive number and$ d$ be the last digit of $n$. Define $f(n) = \lfloor \frac{n}{10} \rfloor + d \cdot m$. Then, we can call $m$ a [i]divisibility multiplier[/i] for $p$, if $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$. Find a divisibility multiplier for $2013$.
Let $A_1, A_2, A_3$ be nonempty sets of integers such that for $\{i, j, k\} = \{1, 2, 3\}$ holds $$(x \in A_i, y\in A_j) \Rightarrow (x + y \in A_k, x - y \in A_k).$$ Prove that at least two of the sets $A_1, A_2, A_3$ are equal. Can any of these sets be disjoint?
If two points are selected at random on a fixed circle and the chord between the two points is drawn, what is the probability that its length exceeds the radius of the circle?
Let $f_1 = (a_1, a_2, \dots , a_n) , n > 2$, be a sequence of integers. From $f_1$ one constructs a sequence $f_k$ of sequences as follows: if $f_k = (c_1, c_2, \dots, cn)$, then $f_{k+1} = (c_{i_{1}}, c_{i_{2}}, c_{i_{3}} + 1, c_{i_{4}} + 1, . . . , c_{i_{n}} + 1)$, where $(c_{i_{1}}, c_{i_{2}},\dots , c_{i_{n}})$ is a permutation of $(c_1, c_2, \dots, c_n)$. Give a necessary and sufficient condition for $f_1$ under which it is possible for $f_k$ to be a constant sequence $(b_1, b_2,\dots , b_n), b_1 = b_2 =\cdots = b_n$, for some $k.$
Let $n$ be a positive integer and let $d_1, d_2, \dots, d_k$ be its positive divisors. Consider the number $$f(n) = (-1)^{d_1}d_1 + (-1)^{d_2}d_2 + \dots + (-1)^{d_k}d_k$$ Assume $f(n)$ is a power of 2. Show if $m$ is an integer greater than 1, then $m^2$ does not divide $n$.
Two externally tangent circles $\omega_1$ and $\omega_2$ have centers $O_1$ and $O_2$, respectively. A third circle $\Omega$ passing through $O_1$ and $O_2$ intersects $\omega_1$ at $B$ and $C$ and $\omega_2$ at $A$ and $D$, as shown. Suppose that $AB = 2$, $O_1O_2 = 15$, $CD = 16$, and $ABO_1CDO_2$ is a convex hexagon. Find the area of this hexagon. [asy] import geometry; size(10cm); point O1=(0,0),O2=(15,0),B=9*dir(30); circle w1=circle(O1,9),w2=circle(O2,6),o=circle(O1,O2,B); point A=intersectionpoints(o,w2)[1],D=intersectionpoints(o,w2)[0],C=intersectionpoints(o,w1)[0]; filldraw(A--B--O1--C--D--O2--cycle,0.2*red+white,black); draw(w1); draw(w2); draw(O1--O2,dashed); draw(o); dot(O1); dot(O2); dot(A); dot(D); dot(C); dot(B); label("$\omega_1$",8*dir(110),SW); label("$\omega_2$",5*dir(70)+(15,0),SE); label("$O_1$",O1,W); label("$O_2$",O2,E); label("$B$",B,N+1/2*E); label("$A$",A,N+1/2*W); label("$C$",C,S+1/4*W); label("$D$",D,S+1/4*E); label("$15$",midpoint(O1--O2),N); label("$16$",midpoint(C--D),N); label("$2$",midpoint(A--B),S); label("$\Omega$",o.C+(o.r-1)*dir(270)); [/asy]
Nine skiers left the start line in turn and covered the distance, each at their own constant speed. Could it turn out that each skier participated in exactly four overtakes? (In each overtaking, exactly two skiers participate - the one who is overtaking, and the one who is being overtaken.)