Sam has 1 Among Us task left. He and his task are located at two randomly chosen distinct vertices of a 2021-dimensional unit hypercube. Let $E$ denote the expected distance he has to walk to get to his task, given that he is only allowed to walk along edges of the hypercube. Compute $\lceil 10E \rceil$. [i]Proposed by Sammy Charney[/i]

A sequence of real numbers $a_1, a_2, a_3, \dots$ satisfies $0 \leq a_1 \leq 1$ and $a_{n+1} = \tfrac{1 + \sqrt{a_n}}{2}$ for all positive integers $n$. If $a_1 + a_{2021} = 1$, then the product $a_1a_2a_3\cdots a_{2020}$ can be written in the form $m^k$, where $k$ is an integer and $m$ is a positive integer that is not divisible by any perfect square greater than $1$. Compute $m + k$.

Three circles with radii $23$, $46$, and $69$ are tangent to each other as shown in the figure below (figure is not drawn to scale). Find the radius of the largest circle that can fit inside the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/6/d/158abc178e4ddd72541580958a4ee2348b2026.png[/img]

A simplified model of a bicycle of mass $M$ has two tires that each comes into contact with the ground at a point. The wheelbase of this bicycle (the distance between the points of contact with the ground) is $w$, and the center of mass of the bicycle is located midway between the tires and a height h above the ground. The bicycle is moving to the right, but slowing down at a constant rate. The acceleration has a magnitude $a$. Air resistance may be ignored. [asy] size(175); pen dps = linewidth(0.7) + fontsize(4); defaultpen(dps); draw(circle((0,0),1),black+linewidth(2.5)); draw(circle((3,0),1),black+linewidth(2.5)); draw((1.5,0)--(0,0)--(1,1.5)--(2.5,1.5)--(1.5,0)--(1,1.5),black+linewidth(1)); draw((3,0)--(2.4,1.8),black+linewidth(1)); filldraw(circle((1.5,2/3),0.05),gray); draw((1.3,1.6)--(0.7,1.6)--(0.7,1.75)--cycle,black+linewidth(1)); label("center of mass of bicycle",(2.5,1.9)); draw((1.55,0.85)--(1.8,1.8),BeginArrow); draw((4.5,-1)--(4.5,2/3),BeginArrow,EndArrow); label("$h$",(4.5,-1/6),E); draw((1.5,2/3)--(4.5,2/3),dotted); draw((0,-1)--(4.5,-1),dotted); draw((0,-5/4)--(3,-5/4),BeginArrow,EndArrow); label("$w$",(3/2,-5/4),S); draw((0,-1)--(0,-6/4),dotted); draw((3,-1)--(3,-6/4),dotted); [/asy] Case 1 ([b][u]Questions 28 - 29[/u][/b]): Assume that the coefficient of sliding friction between each tire and the ground is $\mu$, and that both tires are skidding: sliding without rotating. Express your answers in terms of $w$, $h$, $M$, and $g$. What is the maximum value of $a$ so that both tires remain in contact with the ground? $ \textbf{(A)}\ \frac{wg}{h} $ $ \textbf{(B)}\ \frac{wg}{2h}$ $ \textbf{(C)}\ \frac{hg}{2w} $ $ \textbf{(D)}\ \frac{h}{2wg} $ $ \textbf{(E)}\ \text{none of the above} $

In triangle $ABC$ medians of triangle $BE$ and $AD$ are perpendicular to each other. Find the length of $\overline{AB}$, if $\overline{BC}=6$ and $\overline{AC}=8$

As shown in the figure, it is known that $BC= AC$ in $\vartriangle ABC$, $M$ is the midpoint of $AB$, points $D$, $E$ lie on $AB$ such that $\angle DCE= \angle MCB$, the circumscribed circle of $\vartriangle BDC$ and the circumscribed circle of $\vartriangle AEC$ intersect at point $F $(different from point $C$), point $H$ lies on $AB$ such that the straight line $CM$ bisects the line segment $HF$. Let the circumcenters of $\vartriangle HFE$ and $\vartriangle BFM$ be $O_1$, $O_2$ respectively. Prove that $O_1O_2 \perp CF$. [img]https://cdn.artofproblemsolving.com/attachments/8/c/62d4ecbc18458fb4f2bf88258d5024cddbc3b0.jpg[/img]

$\text{Find }\left(\sum_{k=1}^{2023}{(k^{42432})}\right)\text{ mod 2023}$ [i]Tiebreaker #1[/i]

Find all $4$ consecutive even numbers, such that the sum of their squares divides the square of their product.

The maximum number of solid regular tetrahedrons can be placed against each other so that one of their edges coincides with a given line segment in space? [hide=original wording]Hoeveel massieve regelmatige viervlakken kan men maximaal tegen mekaar plaatsen zodat ´e´en van hun ribben samenvalt met een gegeven lijnstuk in de ruimte?[/hide]

How many functions $f : \{1,2,3,4,5,6\} \to \{1,2,3,4,5,6\}$ have the property that $f(f(x))+f(x)+x$ is divisible by $3$ for all $x \in \{1,2,3,4,5,6\}?$ [i]Proposed by Kyle Lee[/i]

Let $p$ be an odd prime and $a_1, a_2,...,a_p$ be integers. Prove that the following two conditions are equivalent: 1) There exists a polynomial $P(x)$ with degree $\leq \frac{p-1}{2}$ such that $P(i) \equiv a_i \pmod p$ for all $1 \leq i \leq p$ 2) For any natural $d \leq \frac{p-1}{2}$, $$ \sum_{i=1}^p (a_{i+d} - a_i )^2 \equiv 0 \pmod p$$ where indices are taken $\pmod p$

Let $ABC$ be an acute triangle with altitudes $AA'$ and $BB'$ and orthocenter $H$. Let $C_0$ be the midpoint of the segment $AB$. Let $g$ be the line symmetric to the line $CC_0$ with respect to the angular bisector of $\angle ACB$. Let $h$ be the line symmetric to the line $HC_0$ with respect to the angular bisector of $\angle AHB$. Show that the lines $g$ and $h$ intersect on the line $A'B'$.

In triangle $ABC$, $AB = 52$, $BC = 56$, $CA = 60$. Let $D$ be the foot of the altitude from $A$ and $E$ be the intersection of the internal angle bisector of $\angle BAC$ with $BC$. Find $DE$.

Let $a \ne 0$ be a natural number. Prove that $a$ is a perfect square if and only if for every $b \in N^*$ there exists $c \in N^*$ such that $a + bc$ is a perfect square.

Let $x$ and $y$ be real numbers satisfying the equation $x^2-4x+y^2+3=0$. If the maximum and minimum values of $x^2+y^2$ are $M$ and $m$ respectively, compute the numerical value of $M-m$.

Consider the sequence $a_1, a_2, a_3, \ldots$ with $$ a_n = \frac{1}{n(n+1)}.$$ In how many ways can the number $\frac{1}{1980}$ be represented as the sum of finitely many consecutive terms of this sequence?

Amelia has a coin that lands heads with probability $\frac{1}{3}$, and Blaine has a coin that lands on heads with probability $\frac{2}{5}$. Amelia and Blaine alternately toss their coins until someone gets a head; the first one to get a head wins. All coin tosses are independent. Amelia goes first. The probability that Amelia wins is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. What is $q-p$? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Consider the sequence $ \left( x_n \right)_{n\ge 1} $ having $ x_1>1 $ and satisfying the equation $$ x_1+x_2+\cdots +x_{n+1} =x_1x_2\cdots x_{n+1} ,\quad\forall n\in\mathbb{N} . $$ Show that this sequence is convergent and find its limit.

In an acute triangle $ ABC$ segments $ BE$ and $ CF$ are altitudes. Two circles passing through the point $ A$ and $ F$ and tangent to the line $ BC$ at the points $ P$ and $ Q$ so that $ B$ lies between $ C$ and $ Q$. Prove that lines $ PE$ and $ QF$ intersect on the circumcircle of triangle $ AEF$. [i]Proposed by Davood Vakili, Iran[/i]

Given are real numbers $a_1, a_2, \ldots, a_n$ ($n>3$), such that $a_k^3=a_{k+1}^2+a_{k+2}^2+a_{k+3}^2$ for all $k=1,2,...,n$. Prove that all numbers are equal.

Source: 2018 Canadian Open Math Challenge Part B Problem 1 ----- Let $(1+\sqrt2)^5 = a+b\sqrt2$, where $a$ and $b$ are positive integers. Determine the value of $a+b.$

Let $n$ and $k$ be positive integers satisfying $k\leq2n^2$. Lee and Sunny play a game with a $2n\times2n$ grid paper. First, Lee writes a non-negative real number no greater than $1$ in each of the cells, so that the sum of all numbers on the paper is $k$. Then, Sunny divides the paper into few pieces such that each piece is constructed by several complete and connected cells, and the sum of all numbers on each piece is at most $1$. There are no restrictions on the shape of each piece. (Cells are connected if they share a common edge.) Let $M$ be the number of pieces. Lee wants to maximize $M$, while Sunny wants to minimize $M$. Find the value of $M$ when Lee and Sunny both play optimally.

Prove that in a triangle one of the sides is twice as large as the other if and only if a median and an angle bisector of this triangle are perpendicular

With expressions containing the symbol $*$, the following transformations can be performed: 1) rewrite the expression in the form $x * (y * z) as ((1 * x) * y) * z$; 2) rewrite the expression in the form $x * 1$ as $x$. Conversions can only be performed with an integer expression, but not with its parts. For example, $(1 *1) * (1 *1)$ can be rewritten according to the first rule as $((1 * (1 * 1)) * 1) * 1$ (taking $x = 1 * 1$, $y = 1$ and $z = 1$), but not as $1 * (1 * 1)$ or $(1* 1) * 1$ (in the last two cases, the second rule would be applied separately to the left or right side $1 * 1$). Find all positive integers $n$ for which the expression $\underbrace{1 * (1 * (1 * (...* (1 * 1)...))}_{n units}$ it is possible to lead to a form in which there is not a single asterisk. Note. The expressions $(x * y) * $z and $x * (y * z)$ are considered different, also, in the general case, the expressions $x * y$ and $y * x$ are different.

You are standing at a pole and a snail is moving directly away from the pole at $1$ cm/s. When the snail is $1$ meter away, you start "Round 1". In Round $n$ ($n\ge 1$), you move directly toward the snail at $n+1$ cm/s. When you reach the snail, you immediately turn around and move back to the starting pole at $n + 1$ cm/s. When you reach the pole, you immediately turn around and Round $n + 1$ begins. At the start of Round $100$, how many meters away is the snail?