Among 6 coins one is counterfeit (its weight differs from that real one and neither weights is known). Using scales that show the total weight of coins placed on the cup, find the counterfeit coin in 3 weighings. [i](4 points)[/i]

The diagonals of a rectangle $ABCD$ meet at point $E$. A circle centered at $E$ lies inside the rectangle. Let $CF$, $DG$, $AH$ be the tangents to this circle from $C$, $D$, $A$; let $CF$ meet $DG$ at point $I$, $EI$ meet $AD$ at point $J$, and $AH$ meet $CF$ at point $L$. Prove that $LJ$ is perpendicular to $AD$.

A circle of radius $a$ is revolved through $180^{\circ}$ about a line in its plane, distant $b$ from the center of the circle, where $b>a$. For what value of the ratio $\frac{b}{a}$ does the center of gravity of the solid thus generated lie on the surface of the solid?

In the acute-angled triangle $ABC$, the point $F$ is the foot of the altitude from $A$, and $P$ is a point on the segment $AF$. The lines through $P$ parallel to $AC$ and $AB$ meet $BC$ at $D$ and $E$, respectively. Points $X \ne A$ and $Y \ne A$ lie on the circles $ABD$ and $ACE$, respectively, such that $DA = DX$ and $EA = EY$. Prove that $B, C, X,$ and $Y$ are concyclic.

A certain organization has $n$ members, and it has $n\plus{}1$ three-member committees, no two of which have identical member-ship. Prove that there are two committees which share exactly one member.

Let $\varphi$ denote the Euler phi-function. Prove that for every positive integer $n$ $$2^{n(n+1)} | 32 \cdot \varphi \left( 2^{2^n} - 1 \right).$$

Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

Given a line segment $PQ$ with endpoints on the parabola $y=x^2$ such that the area bounded by $PQ$ and the parabola always equal to $\frac 43.$ Find the equation of the locus of the midpoint $M$.

Let a sequence of positive reals $\{u_n\}^{\infty}_{n=1}$ be given. For every positive integer $n$, let $k_n$ be the least positive integer satisfying: \[\sum^{k_n}_{i=1} \frac{1}{i} \geq \sum^n_{i=1} u_i.\] Show that the sequence $\left\{\frac{k_{n+1}}{k_n}\right\}$ has finite limit if and only if $\{u_n\}$ does.

A natural number $n$ is written on the board. Ben plays a game as follows: in every step, he deletes the number written on the board, and writes either the number which is three greater or two less than the number he has deleted. Is it possible that for every value of $n$, at some time, he will get to the number $2020$?

Prove that $2^{n - 1}$ divides $n!$ if and only if $n = 2^{k - 1}$ for some positive integer $k$.

For each positive integer $n$, let $d(n)$ be the number of positive integer divisors of $n$. Prove that for all pairs of positive integers $(a,b)$ we have that: \[ d(a)+d(b) \le d(\gcd(a,b))+d(\text{lcm}(a,b)) \] and determine all pairs of positive integers $(a,b)$ where we have equality case.

John has a standard four-sided die. Each roll, he gains points equal to the value of the roll multiplied by the number of times he has now rolled that number; for example, if his first rolls were $3,3,2,3$, he would have $3+6+2+9=20$ points. Find the expected number of points John will have after rolling the die 25 times.

Suppose $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function such that $$f^n(n) = 2n$$ for all $n\in \mathbb{N}$. Must $f(n) = n+1$ for all $n$?

Find all composite numbers $n$ such that for each decomposition of $n=xy$, $x+y$ be a power of $2$.

Given acute triangle $\vartriangle ABC$ with orthocenter $H$ and circumcenter $O$ ($O \ne H$) . Let $\Gamma$ be the circumcircle of $\vartriangle BOC$ . Segment $OH$ untersects $\Gamma$ at point $P$. Extension of $AO$ intersects $\Gamma$ at point $K$. If $AP \perp OH$, prove that $PK$ bisects $BC$. [img]https://cdn.artofproblemsolving.com/attachments/a/b/267053569c41692f47d8f4faf2a31ebb4f4efd.png[/img]

Let $n$ be a fixed positive integer. Find all the positive integers $m$ such that $$\frac{m^2+4m}{a_1}+\frac{m^2+8m}{a_1+a_2}+\frac{m^2+12m}{a_1+a_2+a_3}+...+\frac{m^2+4nm}{a_1+a_2+...+a_n}<2500 \left(\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}\right)$$ for any positive numbers $a_1,a_2,...,a_n$. Justify your answer.

Three prime numbers $p,q,r$ and a positive integer $n$ are given such that the numbers \[ \frac{p+n}{qr}, \frac{q+n}{rp}, \frac{r+n}{pq} \] are integers. Prove that $p=q=r $. [i]Nazar Agakhanov[/i]

[u]Round 1[/u] [b]p1. [/b] What is the sum of the digits in the binary representation of $2023$? [b]p2.[/b] Jack is buying fruits at the EMCCmart. Three apples and two bananas cost $\$11.00$. Five apples and four bananas cost $\$19.00$. In cents, how much more does an apple cost than a banana? [b]p3.[/b] Define $a \sim b$ as $a! - ab$. What is $(4 \sim 5) \sim (5 \sim (3 \sim 1))$? [u] Round 2[/u] [b]p4.[/b] Alan has $24$ socks in his drawer. Of these socks, $4$ are red, $8$ are blue, and $12$ are green. Alan takes out socks one at a time from his drawer at random. What is the minimum number of socks he must pull out to guarantee that the number of green socks is at least twice the number of red socks? [b]p5.[/b] What is the remainder when the square of the $24$th smallest prime number is divided by $24$? [b]p6.[/b] A cube and a sphere have the same volume. If $k$ is the ratio of the length of the longest diagonal of the cube to the diameter of the sphere, find $k^6$. [u]Round 3[/u] [b]p7.[/b] Equilateral triangle $ABC$ has side length $3\sqrt3$. Point $D$ is drawn such that $BD$ is tangent to the circumcircle of triangle $ABC$ and $BD = 4$. Find the distance from the circumcenter of triangle $ABC$ to $D$. [b]p8.[/b] If $\frac{2023!}{2^k}$ is an odd integer for an integer $k$, what is the value of $k$? [b]p9.[/b] Let $S$ be a set of 6 distinct positive integers. If the sum of the three smallest elements of $S$ is $8$, and the sum of the three largest elements of $S$ is $19$, find the product of the elements in $S$. [u]Round 4[/u] [b]p10.[/b] For some integers $b$, the number $1 + 2b + 3b^2 + 4b^3 + 5b^4$ is divisible by $b + 1$. Find the largest possible value of $b$. [b]p11.[/b] Let $a, b, c$ be the roots of cubic equation $x^3 + 7x^2 + 8x + 1$. Find $a^2 + b^2 + c^2 + \frac{1}{a} + \frac{1}{b} + \frac{1}{c}$ [b]p12.[/b] Let $C$ be the set of real numbers $c$ such that there are exactly two integers n satisfying $2c < n < 3c$. Find the expected value of a number chosen uniformly at random from $C$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3131590p28370327]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In triangle $ABC$, $AB=AC$, $|BC|$ and $d(A,BC)$ are both integers. Then, $\sin A$ and $\cos A$ $\text{(A)}$ one is a rational number while the other is not $\text{(B)}$ both are rational numbers $\text{(C)}$ neither is rational number $\text{(D)}$ not sure

Find the least value of $k$ such that for all $a,b,c,d \in \mathbb{R}$ the inequality \[ \begin{array} c \sqrt{(a^2+1)(b^2+1)(c^2+1)} +\sqrt{(b^2+1)(c^2+1)(d^2+1)} +\sqrt{(c^2+1)(d^2+1)(a^2+1)} +\sqrt{(d^2+1)(a^2+1)(b^2+1)} \\ \ \\ \ge 2( ab+bc+cd+da+ac+bd)-k \end{array}\] holds.

$(4^{-1} - 3^{-1})^{-1} =$ $ \textbf{(A)}\ -12\qquad\textbf{(B)}\ -1\qquad\textbf{(C)}\ \frac{1}{12}\qquad\textbf{(D)}\ 1\qquad\textbf{(E)}\ 12 $

A clock chimes once at $ 30$ minutes past each hour and chimes on the hour according to the hour. For example, at 1 PM there is one chime and at noon and midnight there are twelve chimes. Starting at 11:15 AM on February $ 26$, $ 2003$, on what date will the $ 2003^{\text{rd}}$ chime occur? $ \textbf{(A)}\ \text{March 8} \qquad \textbf{(B)}\ \text{March 9} \qquad \textbf{(C)}\ \text{March 10} \qquad \textbf{(D)}\ \text{March 20} \qquad \textbf{(E)}\ \text{March 21}$

Let $M$ be a set of $n \ge 4$ points in the plane, no three of which are collinear. Initially these points are connected with $n$ segments so that each point in $M$ is the endpoint of exactly two segments. Then, at each step, one may choose two segments $AB$ and $CD$ sharing a common interior point and replace them by the segments $AC$ and $BD$ if none of them is present at this moment. Prove that it is impossible to perform $n^3 /4$ or more such moves. [i]Proposed by Vladislav Volkov, Russia[/i]

You want to color a flag like the one shown in the following image, for which four different colors are available. Two regions of the flag that share a side (or a segment of a side) must have different colors. The flag cannot be flipped, rotated, or reflected. How many different flags can be colored with these conditions? [img]https://cdn.artofproblemsolving.com/attachments/4/9/879d1e144acdbc63ee2ffe34cf13a920d5d836.png[/img]