Let $A$ be the set $A = \{ 1,2, \ldots, n\}$. Determine the maximum number of elements of a subset $B\subset A$ such that for all elements $x,y$ from $B$, $x+y$ cannot be divisible by $x-y$. [i]Mircea Lascu, Dorel Mihet[/i]

The figure shows a game board with $16$ squares. At the start of the game, two cars are placed in different squares. Two players $A$ and $B$ alternately take turns, and A starts. In each turn, the player chooses one of the cars and moves it one or more squares to the right. The left-most car may never overtake or land on the same square as the right-most car. The first player which is unable to move loses. [img]https://cdn.artofproblemsolving.com/attachments/1/b/8d6f40fac4983d6aa9bd076392c91a6d200f6a.png[/img] (a) Prove that A can win regardless of how $B$ plays, if the two cars start as shown in the figure. (b) Determine all starting positions in which $B$ can win regardless of how $A$ plays.

Tyler has two calculators, both of which initially display zero. The first calculators has only two buttons, $[+1]$ and $[\times 2]$. The second has only the buttons $[+1]$ and $[\times 4]$. Both calculators update their displays immediately after each keystroke. A positive integer $n$ is called [i]ambivalent[/i] if the minimum number of keystrokes needed to display $n$ on the first calculator equals the minimum number of keystrokes needed to display $n$ on the second calculator. Find the sum of all ambivalent integers between $256$ and $1024$ inclusive. [i]Proposed by Joshua Xiong[/i]

Andrew writes down all of the prime numbers less than $50$. How many times does he write the digit $2$?

Let O be the circumcenter of triangle ABC. Let H be the orthocenter of triangle ABC. the perpendicular bisector of AB meet AC,BC at D,E. the circumcircle of triangle DEH meet AC,BC,OH again at F,G,L. CH meet FG at T,and ABCT is concyclic. Prove that LHBC is concyclic. graph: https://cdn.luogu.com.cn/upload/image_hosting/w6z6mvm4.png

Compute the number of two digit positive integers that are divisible by both of their digits. For example, $36$ is one of these two digit positive integers because it is divisible by both $3$ and $6$. [i]2021 CCA Math Bonanza Lightning Round #2.4[/i]

Prove for positive reals $a,b,c$ that $(ab+bc+ca+1)(a+b)(b+c)(c+a) \ge 2abc(a+b+c+1)^2$

A geometrical progression consists of $37$ positive integers. The first and the last terms are relatively prime numbers. Prove that the $19^{th}$ term of the progression is the $18^{th}$ power of some positive integer. [i]($3$ points)[/i]

For a constant $c$, a sequence $a_n$ is defined by $a_n=\int_c^1 nx^{n-1}\left(\ln \left(\frac{1}{x}\right)\right)^n dx\ (n=1,\ 2,\ 3,\ \cdots).$ Find $\lim_{n\to\infty} a_n$.

On the sides $ AB,AC $ of a triangle $ ABC, $ consider the points $ M, $ respectively, $ N $ such that $ M\neq A\neq N $ and $ \frac{MB}{MA}\neq\frac{NC}{NA}. $ Show that the line $ MN $ passes through a point not dependent on $ M $ and $ N. $

Find the graph of the function $y=1-|1-sin x|$.

For non-negative integers $n$ and $k$, let $P_{n, k}(x)$ denote the rational function \[\frac{(x^{n}-1)(x^{n}-x) \cdots (x^{n}-x^{k-1})}{(x^{k}-1)(x^{k}-x) \cdots (x^{k}-x^{k-1})}.\] Show that $P_{n, k}(x)$ is actually a polynomial for all $n, k \in \mathbb{N}$.

Let $\overline{CH}$ be an altitude of $\triangle ABC$. Let $R$ and $S$ be the points where the circles inscribed in the triangles $ACH$ and $BCH$ are tangent to $\overline{CH}$. If $AB = 1995$, $AC = 1994$, and $BC = 1993$, then $RS$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime integers. Find $m + n$

Solve $ \quad 5\lfloor x^2\rfloor -2\lfloor x\rfloor +2=0. $

Let $n\geqslant 2$ be an integer. Prove that for any positive real numbers $a_1, a_2,\ldots, a_n$, \[\frac{1}{2\sqrt{2}}\sum_{i=1}^{n}2^{i}a_i^2 \geqslant\sum_{1 \leqslant i < j \leqslant n}a_i a_j.\][i]Proposed by Andrei Vila[/i]

In $\vartriangle ABC$, $AB = 3$, $BC = 5$, and $CA = 6$. Points $D$ and $E$ are chosen such that $ACDE$ is a square which does not overlap with $\vartriangle ABC$. The length of $BD$ can be expressed in the form $\sqrt{m + n\sqrt{p}}$, where $m$, $n$, and $p$ are positive integers and $p$ is not divisible by the square of a prime. Determine the value of $m + n + p$.

You are playing a game in which you have $3$ envelopes, each containing a uniformly random amount of money between $0$ and $1000$ dollars. (That is, for any real $0 \leq a < b \leq 1000$, the probability that the amount of money in a given envelope is between $a$ and $b$ is $\frac{b-a}{1000}$.) At any step, you take an envelope and look at its contents. You may choose either to keep the envelope, at which point you finish, or discard it and repeat the process with one less envelope. If you play to optimize your expected winnings, your expected winnings will be $E$. What is $\lfloor E\rfloor,$ the greatest integer less than or equal to $E$? [i]Author: Alex Zhu[/i]

Let $(G, \cdot )$ be a group and $e$ an identity element. Prove that if all elements $x$ of $G$ satisfy $x\cdot x = e$ then $(G, \cdot)$ is abelian (that is, commutative).

Prove that every integer can be written as sum of $5$ third powers of integers.

$\dfrac{1}{1+\dfrac{1}{2+\dfrac{1}{3}}} =$ $\text{(A)}\ \dfrac{1}{6} \qquad \text{(B)}\ \dfrac{3}{10} \qquad \text{(C)}\ \dfrac{7}{10} \qquad \text{(D)}\ \dfrac{5}{6} \qquad \text{(E)}\ \dfrac{10}{3}$

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

James the naked mole rat is hopping on the number line. He starts at $0$ and jumps exactly $2^{n}$ either forward or backward at random at time $n$ seconds, his first jump being at time $n = 0$. What is the expected number of jumps James takes before he is on a number that exceeds $8$?

Find all $4$-tuples $(a,b,c,d)$ of natural numbers with $a \le b \le c$ and $a!+b!+c!=3^d$

Find, with proof, all triples of integers $ (a,b,c)$ such that $ a, b$ and $ c$ are the lengths of the sides of a right angled triangle whose area is $ a \plus{} b \plus{} c$

Let $k$ be a positive integer congruent to $1$ modulo $4$ which is not a perfect square and let $a=\frac{1+\sqrt{k}}{2}$. Show that $\{\left \lfloor{a^2n}\right \rfloor-\left \lfloor{a\left \lfloor{an}\right \rfloor}\right \rfloor : n \in \mathbb{N}_{>0}\}=\{1 , 2 , \ldots ,\left \lfloor{a}\right \rfloor\}$.