How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?

Find all pairs of integers $ (x,y)$ satisfying $ 1\plus{}1996x\plus{}1998y\equal{}xy.$

$234$ viewers came to the cinema. Determine for which$ n \ge 4$ the viewers could be can be arranged in $n$ rows so that every viewer in $i$-th row gets to know just $j$ viewers in $j$-th row for any $i, j \in \{1, 2,... , n\}, i\ne j$. (The relationship of acquaintance is mutual.) (Tomáš Jurík)

Let $S$ be a set of intervals defined recursively as follows: [list][*] Initially, $[1,1000]$ is the only interval in $S$. [*]If $l\neq r$ and $[l,r]\in S$, then both $\left[l,\left\lfloor \frac{l+r}{2}\right\rfloor\right], \left[\left\lfloor \frac{l+r}{2}\right\rfloor+1,r\right]\in S$. [/list] (Note that $S$ can contain intervals such as $[1, 1]$, which contain a single integer.) An integer $i$ is chosen uniformly at random from the range $[1,1000]$. What is the expected number of intervals in $S$ which contain $i$? [i]Proposed by Benjamin Qi.[/i]

Let $ABCD$ be a parallelogram with an acute angle at $A$. Let $G$ be a point on the line $AB$, distinct from $B$, such that $|CG| = |CB|$. Let $H$ be a point on the line $BC$, distinct from $B$, such that $|AB| =|AH|$. Prove that triangle $DGH$ is isosceles. [asy] unitsize(1.5 cm); pair A, B, C, D, G, H; A = (0,0); B = (2,0); D = (0.5,1.5); C = B + D - A; G = reflect(A,B)*(C) + C - B; H = reflect(B,C)*(H) + A - B; draw(H--A--D--C--G); draw(interp(A,G,-0.1)--interp(A,G,1.1)); draw(interp(C,H,-0.1)--interp(C,H,1.1)); draw(D--G--H--cycle, dashed); dot("$A$", A, SW); dot("$B$", B, SE); dot("$C$", C, E); dot("$D$", D, NW); dot("$G$", G, NE); dot("$H$", H, SE); [/asy]

If $f(1) = 1$ and $f(n+1) = \frac{2f(n) + 1}{2}$, then find $f(237)$. $\text{(A) }117\qquad\text{(B) }118\qquad\text{(C) }119\qquad\text{(D) }120\qquad\text{(E) }121$

An integer $n$ is chosen uniformly at random from the set $\{1, 2, \ldots, 2023!\}.$ Compute the probability that $$\gcd(n^n+50, n+1)=1.$$

Let $ ABCD$ be a given tetrahedron, with $ BC \equal{} a$, $ CA \equal{} b$, $ AB \equal{} c$, $ DA \equal{} a_1$, $ DB \equal{} b_1$, $ DC \equal{} c_1$. Prove that there is a unique point $ P$ satisfying \[ PA^2 \plus{} a_1^2 \plus{} b^2 \plus{} c^2 \equal{} PB^2 \plus{} b_1^2 \plus{} c^2 \plus{} a^2 \equal{} PC^2 \plus{} c_1^2 \plus{} a^2 \plus{} b^2 \equal{} PD^2 \plus{} a_1^2 \plus{} b_1^2 \plus{} c_1^2 \] and for this point $ P$ we have $ PA^2 \plus{} PB^2 \plus{} PC^2 \plus{} PD^2 \ge 4R^2$, where $ R$ is the circumradius of the tetrahedron $ ABCD$. Find the necessary and sufficient condition so that this inequality is an equality.

Let $x $ and $y $ be positive integers such that $[x+2,y+2]-[x+1,y+1]=[x+1,y+1]-[x,y]$.Prove that one of the two numbers $x $ and $y $ divide the other. (Here $[a,b] $ denote the least common multiple of $a $ and $b $). Proposed by Dusan Djukic.

Let $ABCD$ be an isosceles trapezoid with base $BC$ and $AD$. Suppose $\angle BDC=10^{\circ}$ and $\angle BDA=70^{\circ}$. Show that $AD^2=BC(AD+AB)$.

Prove that for positive real numbers $ a$, $ b$, $ c$, $ d$, we have \[ \frac{1}{\frac{1}{a}\plus{}\frac{1}{b}}\plus{}\frac{1}{\frac{1}{c}\plus{}\frac{1}{d}}\le\frac{1}{\frac{1}{a\plus{}c}\plus{}\frac{1}{b\plus{}d}}\]

In a triangle $ABC$ let $K$ be a point on the median $BM$ such that $CK=CM$. It appears that $\angle CBM = 2 \angle ABM$. Prove that $BC=MK$.

Let $a$ and $b$ be integers such that the remainder of dividing $a$ by $17$ is equal to the remainder of dividing $b$ by $19$, and the remainder of dividing $a$ by $19$ is equal to the remainder of dividing $b$ by $17$. Determine the possible values of the remainder of $a + b$ when divided by $323$.

In the figure, $ \angle EAB$ and $ \angle ABC$ are right angles. $ AB \equal{} 4, BC \equal{} 6, AE \equal{} 8$, and $ \overline{AC}$ and $ \overline{BE}$ intersect at $ D$. What is the difference between the areas of $ \triangle ADE$ and $ \triangle BDC$? [asy]unitsize(4mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); pair A=(0,0), B=(4,0), C=(4,6), Ep=(0,8); pair D=extension(A,C,Ep,B); draw(A--C--B--A--Ep--B); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,N); label("$E$",Ep,N); label("$D$",D,2.5*N); label("$4$",midpoint(A--B),S); label("$6$",midpoint(B--C),E); label("$8$",(0,3),W);[/asy]$ \textbf{(A)}\ 2\qquad \textbf{(B)}\ 4\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 9$

Prove that for all reas $a,b,c,d\in(0,1)$ we have $$\left(ab-cd\right)\left(ac+bd\right)\left(ad-bc\right)+\min{\left(a,b,c,d\right)} < 1.$$

Let $a$, $b$, $c$ be positive real numbers such that $\min(ab,bc,ca) \ge 1$. Prove that $$\sqrt[3]{(a^2+1)(b^2+1)(c^2+1)} \le \left(\frac{a+b+c}{3}\right)^2 + 1.$$ [i]Proposed by Tigran Margaryan, Armenia[/i]

The three distinct points$ B, C, D$ are collinear with C between B and D. Another point A not on the line BD is such that $|AB| = |AC| = |CD|.$ Prove that ∠$BAC = 36$ if and only if $1/|CD|-1/|BD|=1/(|CD| + |BD|)$ .

A Sudoku matrix is defined as a $ 9\times9$ array with entries from $ \{1, 2, \ldots , 9\}$ and with the constraint that each row, each column, and each of the nine $ 3 \times 3$ boxes that tile the array contains each digit from $ 1$ to $ 9$ exactly once. A Sudoku matrix is chosen at random (so that every Sudoku matrix has equal probability of being chosen). We know two of the squares in this matrix, as shown. What is the probability that the square marked by ? contains the digit $ 3$? $ \setlength{\unitlength}{6mm} \begin{picture}(9,9)(0,0) \multiput(0,0)(1,0){10}{\line(0,1){9}} \multiput(0,0)(0,1){10}{\line(1,0){9}} \linethickness{1.2pt} \multiput(0,0)(3,0){4}{\line(0,1){9}} \multiput(0,0)(0,3){4}{\line(1,0){9}} \put(0,8){\makebox(1,1){1}} \put(1,7){\makebox(1,1){2}} \put(3,6){\makebox(1,1){?}} \end{picture}$

Let $AH_A, BH_B$ and $CH_C$ be altitudes in $\triangle ABC$. Let $p_A,p_B,p_C$ be the perpendicular lines from vertices $A,B,C$ to $H_BH_C, H_CH_A, H_AH_B$ respectively. Prove that $p_A,p_B,p_C$ are concurrent lines.

A binary operation $\diamondsuit$ has the properties that $a\,\diamondsuit\, (b\,\diamondsuit \,c) = (a\,\diamondsuit \,b)\cdot c$ and that $a\,\diamondsuit \,a=1$ for all nonzero real numbers $a, b,$ and $c$. (Here $\cdot$ represents multiplication). The solution to the equation $2016 \,\diamondsuit\, (6\,\diamondsuit\, x)=100$ can be written as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. What is $p+q?$ $\textbf{(A) }109\qquad\textbf{(B) }201\qquad\textbf{(C) }301\qquad\textbf{(D) }3049\qquad\textbf{(E) }33,601$

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

The incircle of a right triangle $ABC$ touches the hypotenuse $AB$ at a point $D$. Show that the area of $\triangle ABC$ equals $AD\cdot DB$.

Compute $$\sum_{\underset{a \ge 6, b,c \ge 0}{a+b+c=12}} \frac{a!}{b!c!(a-b-c)!},$$ where the sum runs over all triples of nonnegative integers $(a,b,c)$ such that $a+b+c=12$ and $a \ge 6.$

Find all pairs of prime numbers $(p, q)$ for which the numbers $p+q$ and $p+4q$ are simultaneously perfect squares.

Integers $n$ and $k$ are given, with $n\ge k\ge2$. You play the following game against an evil wizard. The wizard has $2n$ cards; for each $i=1,\ldots,n$, there are two cards labeled $i$. Initially, the wizard places all cards face down in a row, in unknown order. You may repeatedly make moves of the following form: you point to any $k$ of the cards. The wizard then turns those cards face up. If any two of the cards match, the game is over and you win. Otherwise, you must look away, while the wizard arbitrarily permutes the $k$ chosen cards and then turns them back face-down. Then, it is your turn again. We say this game is [i]winnable[/i] if there exist some positive integer $m$ and some strategy that is guaranteed to win in at most $m$ moves, no matter how the wizard responds. For which values of $n$ and $k$ is the game winnable?