The Miami Heat and the San Antonio Spurs are playing a best-of-five series basketball championship, in which the team that first wins three games wins the whole series. Assume that the probability that the Heat wins a given game is $x$ (there are no ties). The expected value for the total number of games played can be written as $f(x)$, with $f$ a polynomial. Find $f(-1)$.

$ 101$ positive integers are written on a line. Prove that we can write signs $ \plus{}$, signs $ \times$ and parenthesis between them, without changing the order of the numbers, in such a way that the resulting expression makes sense and the result is divisible by $ 16!$.

Let $O$ be the circumcenter of a triangle $ABC$, and let $l$ be the line going through the midpoint of the side $BC$ and is perpendicular to the bisector of $\angle BAC$. Determine the value of $\angle BAC$ if the line $l$ goes through the midpoint of the line segment $AO$.

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

Ms. Carroll promised that anyone who got all the multiple choice questions right on the upcoming exam would receive an A on the exam. Which of these statements necessarily follows logically? $\textbf{(A)}$ If Lewis did not receive an A, then he got all of the multiple choice questions wrong. \\ $\textbf{(B)}$ If Lewis did not receive an A, then he got at least one of the multiple choice questions wrong. \\ $\textbf{(C)}$ If Lewis got at least one of the multiple choice questions wrong, then he did not receive an A. \\ $\textbf{(D)}$ If Lewis received an A, then he got all of the multiple choice questions right. \\ $\textbf{(E)}$ If Lewis received an A, then he got at least one of the multiple choice questions right.

A circle and two distinct lines are drawn on a sheet of paper. What is the largest possible number of points of intersection of these figures? $ \text{(A)}\ 2\qquad\text{(B)}\ 3\qquad\text{(C)}\ 4\qquad\text{(D)}\ 5\qquad\text{(E)}\ 6 $

The cells of a $8 \times 8$ table are initially white. Alice and Bob play a game. First Alice paints $n$ of the fields in red. Then Bob chooses $4$ rows and $4$ columns from the table and paints all fields in them in black. Alice wins if there is at least one red field left. Find the least value of $n$ such that Alice can win the game no matter how Bob plays.

there are some identical squares with sides parallel, in a plane. Among any $k+1$ of them, there are two with a point in common. Prove they can be divided into $2k-1$ sets, such that all the squares in one set aint pairwise disjoint.

Find all integers $\,a,b,c\,$ with $\,1<a<b<c\,$ such that \[ (a-1)(b-1)(c-1) \] is a divisor of $abc-1.$

In the coordinate plane, denote by $ S(a)$ the area of the region bounded by the line passing through the point $ (1,\ 2)$ with the slope $ a$ and the parabola $ y\equal{}x^2$. When $ a$ varies in the range of $ 0\leq a\leq 6$, find the value of $ a$ such that $ S(a)$ is minimized.

Let $a$ be the least positive integer with $20$ positive divisors and $b$ be the least positive integer with $16$ positive divisors. What is $a+b$? (Note that for any integer $n$, both $1$ and $n$ are considered divisors of $n$.)

Let $a,b,c>0$ be real numbers with sum 1. Prove that \[ \frac{a^2}b + \frac{b^2}c + \frac{c^2} a \geq 3(a^2+b^2+c^2) . \]

In some primary school there were $94$ students in $7$th grade. Some students are involved in extracurricular activities: spanish and german language and sports. Spanish language studies $40$ students outside school program, german $27$ students and $60$ students do sports. Out of the students doing sports, $24$ of them also goes to spanish language. $10$ students who study spanish also study german. $12$ students who study german also do sports. Only $4$ students go to all three activities. How many of them does only one of the activities, and how much of them do not go to any activity?

Let $n$ and $k$ be two natural numbers such that $k$ is even and for each prime $p$ if $p|n$ then $p-1|k$. let $\{a_1,....,a_{\phi(n)}\}$ be all the numbers coprime to $n$. What's the remainder of the number $a_1^k+.....+a_{\phi(n)}^k$ when it's divided by $n$? [i]proposed by Yahya Motevassel[/i]

Given a triangle with $a,b,c$ sides and with the area $1$ ($a \ge b \ge c$). Prove that $b^2 \ge 2$.

A pair $(f,g)$ of degree $2$ real polynomials is called [i]foolish[/i] if $f(g(x)) = f(x) \cdot g(x)$ for all real $x.$ How many positive integers less than $2023$ can be a root of $g(x)$ for some foolish pair $(f,g)$?

There are two countries $A$ and $B$, where each countries have $n(\ge 2)$ airports. There are some two-way flights among airports of $A$ and $B$, so that each airport has exactly $3$ flights. There might be multiple flights among two airports; and there are no flights among airports of the same country. A travel agency wants to plan an [i]exotic traveling course[/i] which travels through all $2n$ airports exactly once, and returns to the initial airport. If $N$ denotes the number of all exotic traveling courses, then prove that $\frac{N}{4n}$ is an even integer. (Here, note that two exotic traveling courses are different if their starting place are different.)

Let $n$ be a positive integer divisible by $4$. Find the number of permutations $\sigma$ of $(1,2,3,\cdots,n)$ which satisfy the condition $\sigma(j)+\sigma^{-1}(j)=n+1$ for all $j \in \{1,2,3,\cdots,n\}$.

The three masses shown in the accompanying diagram are equal. The pulleys are small, the string is lightweight, and friction is negligible. Assuming the system is in equilibrium, what is the ratio $a/b$? The figure is not drawn to scale! [asy] size(250); dotfactor=10; dot((0,0)); dot((15,0)); draw((-3,0)--(25,0),dashed); draw((0,0)--(0,3),dashed); draw((15,0)--(15,3),dashed); draw((0,0)--(0,-15)); draw((15,0)--(15,-10)); filldraw(circle((0,-16),1),lightgray); filldraw(circle((15,-11),1),lightgray); draw((0,0)--(4,-4)); filldraw(circle((4.707,-4.707),1),lightgray); draw((15,0)--(5.62,-4.29)); draw((0.5,3)--(14.5,3),Arrows(size=5)); label(scale(1.2)*"$a$",(7.5,3),1.5*N); draw((2.707,-4.707)--(25,-4.707),dashed); draw((25,-0.5)--(25,-4.2),Arrows(size=5)); label(scale(1.2)*"$b$",(25,-2.35),1.5*E); [/asy] (A) $1/2$ (B) $1$ (C) $\sqrt{3}$ (D) $2$ (E) $2\sqrt{3}$

$ABCD$ is a square. The points $X$ on the side $AB$ and $Y$ on the side $AD$ are such that $AX\cdot AY = 2 BX\cdot DY$. The lines $CX$ and $CY$ meet the diagonal $BD$ in two points. Show that these points lie on the circumcircle of $AXY$.

On $xy$plane the parabola $K: \ y=\frac{1}{d}x^{2}\ (d: \ positive\ constant\ number)$ intersects with the line $y=x$ at the point $P$ that is different from the origin. Assumed that the circle $C$ is touched to $K$ at $P$ and $y$ axis at the point $Q.$ Let $S_{1}$ be the area of the region surrounded by the line passing through two points $P,\ Q$ and $K,$ or $S_{2}$ be the area of the region surrounded by the line which is passing through $P$ and parallel to $x$ axis and $K.$ Find the value of $\frac{S_{1}}{S_{2}}.$

Let $CD$ be an altitude of right-angled triangle $ABC$ with $\angle C = 90$. Regular triangles$ AED$ and $CFD$ are such that $E$ lies on the same side from $AB$ as $C$, and $F$ lies on the same side from $CD$ as $B$. The line $EF$ meets $AC$ at $L$. Prove that $FL = CL + LD$

For each non-negative integer $n$ find the sum of all $n$-digit numbers with the digits in a decreasing sequence. [I]Proposed by P. Kozhevnikov[/I]

Let $ABC$ be a isosceles triangle, with $AB=AC$. A line $r$ that pass through the incenter $I$ of $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. Let $F$ and $G$ be points on $BC$ such that $BF=CE$ and $CG=BD$. Show that the angle $\angle FIG$ is constant when we vary the line $r$.

Let $n\ge 3$ be an integer. Lucas and Matías play a game in a regular $n$-sided polygon with a vertex marked as a trap. Initially Matías places a token at one vertex of the polygon. In each step, Lucas says a positive integer and Matías moves the token that number of vertices clockwise or counterclockwise, at his choice. a) Determine all the $n\ge 3$ such that Matías can locate the token and move it in such a way as to never fall into the trap, regardless of the numbers Lucas says. Give the strategy to Matías. b) Determine all the $n\ge 3$ such that Lucas can force Matías to fall into the trap. Give the strategy to Lucas. Note. The two players know the value of $n$ and see the polygon.