In a town of 351 adults, every adult owns a car, motorcycle, or both. If 331 adults own cars and 45 adults own motorcycles, how many of the car owners do not own a motorcycle? $ \textbf{(A)} 20 \qquad\textbf{(B)} 25 \qquad\textbf{(C)} 45 \qquad\textbf{(D)} 306 \qquad\textbf{(E)} 351$

Let $f(x) = \frac{4^x}{4^x+2}$ for $x > 0$. Evaluate $\sum_{k=1}^{1920}f\left(\frac{k}{1921}\right)$

Let $ABC$ be a triangle with $AB \neq AC$ and with incenter $I$. Let $M$ be the midpoint of $BC$, and let $L$ be the midpoint of the circular arc $BAC$. Lines through $M$ parallel to $BI,CI$ meet $AB,AC$ at $E$ and $F$, respectively, and meet $LB$ and $LC$ at $P$ and $Q$, respectively. Show that $I$ lies on the radical axis of the circumcircles of triangles $EMF$ and $PMQ$. Proposed by [i]Andrew Wu[/i]

Let $n \geq 2$ be a positive integer. Consider the following equation: \[ \{x\}+\{2x\}+ \dots + \{nx\} = \lfloor x \rfloor + \lfloor 2x \rfloor + \dots + \lfloor 2nx \rfloor\] a) For $n=2$, solve the given equation in $\mathbb{R}$. b) Prove that, for any $n \geq 2$, the equation has at most $2$ real solutions.

Find all integers $n$ for which $n(n + 2010)$ is a perfect square.

Let $a, b, c, d, e$ be real numbers satisfying the following conditions. \[a \le b \le c \le d \le e, \quad a+e=1, \quad b+c+d=3, \quad a^2+b^2+c^2+d^2+e^2=14\]Determine the maximum possible value of $ae$.

Let $C$ be a fixed circle, $u > 0$ be a fixed real and let $v_0 , v_1 , v_2 , \ldots$ be a sequence of positive real numbers. Two ants $A$ and $B$ walk around the perimeter of $C$ in opposite directions, starting from the same starting point. Ant $A$ has a constant speed $u$, while ant $B$ has an initial speed $v_0$. For each positive integer $n$, when the two ants collide for the $n$−th time, they change the directions in which they walk around the perimeter of $C$, with ant $A$ remaining at speed $u$ and ant $B$ stops walking at speed $v_{n-1}$ to walk at speed $v_n$. (a) If the sequence $\{v_n\}$ is strictly increasing, with $\lim_{n\rightarrow \infty} v_n = +\infty$, prove that there is exactly one point in $C$ that ant $A$ will pass "infinitely" many times. (b) Prove that there is a sequence $\{v_n\}$ with $\lim_{n\rightarrow\infty} v_n = +\infty$, such that ant $A$ will pass "infinitely" many times through all points on the circle $C$.

There's infinity of the following blocks on the table:$1*1 , 1*2 , 1*3 ,.., 1*n$. We have a $n*n$ table and Ali chooses some of these blocks so that the sum of their area is at least $n^2$. Then , Amir tries to cover the $n*n$ table so that none of blocks go out of the table and they don't overlap and he wanna maximize the covered area in the $n*n$ table with those blocks chosen by Ali. Let $k$ be the maximum coverable area independent of Ali's choice. Prove that: $$n^2 - \lceil \frac{n^2}{4} \rceil \leq k \leq n^2 - \lfloor \frac{n^2}{8} \rfloor$$ *Note : the blocks can be placed only vertically or horizontally.

$A, B, C, D, E$ are five points on the same circle, so that $ABCDE$ is convex and we have $AB = BC$ and $CD = DE$. Suppose that the lines $(AD)$ and $(BE)$ intersect at $P$, and that the line $(BD)$ meets line $(CA)$ at $Q$ and line $(CE)$ at $T$. Prove that the triangle $PQT$ is isosceles. (I. Voronovich)

Find distinct points $A, B, C,$ and $D$ in the plane such that the length of the segment $AB$ is an even integer, and the lengths of the segments $AC, AD, BC, BD,$ and $CD$ are all odd integers. In addition to stating the coordinates of the points and distances between points, please include a brief explanation of how you found the configuration of points and computed the distances.

Given positive integers $a_1, a_2, \ldots, a_{2023}$ such that $$a_k = \sum_{i=1}^{2023} |a_k - a_i|$$ for all $1 \le k \le 2023,$ find the minimum possible value of $a_1+a_2+\ldots+a_{2023}.$

In an acute triangle $AB$ the heights $ BE$ and $CF$ intersect at the orthocenter $H$, and $M$ is the midpoint of $BC$. The line $EF$ intersects the lines $MH$ and $BC$ at the points $P$ and $T$ , respectively. $AP$ intersects the cirumcscribed circle of $\vartriangle ABC$ for second time at the point $Q$ . Prove that $\angle AQT= 90^o$. (Fedir Yudin)

Determine all pairs of integers $(a, b)$ that solve the equation $a^3 + b^3 + 3ab = 1$.

If $0<a<1,x^2+y=0$, prove that $\log_a(a^x+a^y)\leq\log_a2+\frac{1}{8}$.

Trapezoid $ABCD$ with bases $AB$ and $CD$ is inscribed in a circle. Prove that the quadrilateral formed by orthogonal projections of any point of this circle onto lines $AC, BC, AD$ and $BD$ is inscribed.

In a half-ball of radius $3$ is inscribed a cylinder with base lying on the base plane of the half-ball, and another such cylinder with equal volume. If the base-radius of the first cylinder is $\sqrt3$, what is the base-radius of the other one?

Show that if $(a_n)$ is an infinite sequence of distinct positive integers, neither of which contains digit $0$ in the decimal expansion, then $$\sum_{n=1}^{\infty} \frac{1}{a_n}< 29.$$

The set $C$ of all complex numbers $z$ satisfying $(z +1)^2 = az$ for some $a \in [-10,3]$ is the union of two curves intersecting at a single point in the complex plane. If the sum of the lengths of these two curves is $\ell,$ find $\lfloor \ell \rfloor.$

A wizard thinks of a number from $1$ to $n$. You can ask the wizard any number of yes/no questions about the number. The wizard must answer all those questions, but not necessarily in the respective order. What is the least number of questions that must be asked in order to know what the number is for sure. (In terms of $n$.) Fresh translation.

Mrs. Walter gave an exam in a mathematics class of five students. She entered the scores in random order into a spreadsheet, which recalculated the class average after each score was entered. Mrs. Walter noticed that after each score was entered, the average was always an integer. The scores (listed in ascending order) were $ 71$, $ 76$, $ 80$, $ 82$, and $ 91$. What was the last score Mrs. Walter entered? $ \textbf{(A)}\ 71 \qquad \textbf{(B)}\ 76 \qquad \textbf{(C)}\ 80 \qquad \textbf{(D)}\ 82 \qquad \textbf{(E)}\ 91$

Let $A$ be the area of the triangle with sides of length $25, 25$, and $30$. Let $B$ be the area of the triangle with sides of length $25, 25,$ and $40$. What is the relationship between $A$ and $B$? $ \textbf{(A)} A = \dfrac9{16}B \qquad\textbf{(B)} A = \dfrac34B \qquad\textbf{(C)} A=B \qquad\textbf{(D)} A = \dfrac43B \\ \\ \textbf{(E)}A = \dfrac{16}9B $

Let $ABC$ be an equilateral triangle and let $P$ be a point in its interior. Let the lines $AP$, $BP$, $CP$ meet the sides $BC$, $CA$, $AB$ at the points $A_1$, $B_1$, $C_1$, respectively. Prove that $A_1B_1 \cdot B_1C_1 \cdot C_1A_1 \ge A_1B \cdot B_1C \cdot C_1A$.

Half the cells of a $2m \times n$ board are colored black and the other half are colored white. The cells at the opposite ends of the main diagonal are different colors. The center of each black cell is connected to the center of every other black cell by a straight line segment, and similarly for the white cells. Show that we can place an arrow on each segment so that it becomes a vector and the vectors sum to zero.

Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals. Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded? [i]Proposed by Mihai Bălună, Romania[/i]

Kelvin the frog is on the bottom-left lily pad of a $3 \times 3$ grid of lily pads, and his home is at the top right lily pad. He can only jump between two lily pads which are horizontally or vertically adjacent. Compute the number of ways to remove $4$ of the lily pads so that the bottom-left and top-right lily pads both remain, but Kelvin cannot get home.