Determine the locus of points that are the midpoints of segments of equal length, the ends of which lie on the sides of a given right angle.

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Given complex numbers $a,b,c$, we have that $|az^2 + bz +c| \leq 1$ holds true for any complex number $z, |z| \leq 1$. Find the maximum value of $|bc|$.

Let $A_1B_1C_1D_1$ be an arbitrary convex quadrilateral. $P$ is a point inside the quadrilateral such that each angle enclosed by one edge and one ray which starts at one vertex on that edge and passes through point $P$ is acute. We recursively define points $A_k,B_k,C_k,D_k$ symmetric to $P$ with respect to lines $A_{k-1}B_{k-1}, B_{k-1}C_{k-1}, C_{k-1}D_{k-1},D_{k-1}A_{k-1}$ respectively for $k\ge 2$. Consider the sequence of quadrilaterals $A_iB_iC_iD_i$. i) Among the first 12 quadrilaterals, which are similar to the 1997th quadrilateral and which are not? ii) Suppose the 1997th quadrilateral is cyclic. Among the first 12 quadrilaterals, which are cyclic and which are not?

In a $2025 \times 2025$ table, several cells are marked. At each move, Cyril can get to know the number of marked cells in any checkered square inside the initial table, with side less than $2025$. What is the minimal number of moves, which allows to determine the total number of marked cells for sure? (5 marks)

An unordered triple $(a,b,c)$ in one move can be changed to either of the triples: $(a,b,2a+2b-c)$,$(a,2a+2c-b,c)$ or $(2b+2c-a,b,c)$. Can one get from triple $(3,5,14)$ the triple $(9,8,11)$ in finite amount of moves?

A semicircle is inscribed in right triangle $ABC$ with right angle $B$ and has diameter on $AB$, with one end on point $B$. Given that $AB = 15$ and $BC = 8$, determine the radius of the semicircle [i]2015 CCA Math Bonanza Team Round #6[/i]

Given $2n$ natural numbers, so that the average arithmetic of those $2n$ number is $2$. If all the number is not more than $2n$. Prove we can divide those $2n$ numbers into $2$ sets, so that the sum of each set to be the same.

Let $n$ be a positive integer. Suppose that its positive divisors can be partitioned into pairs (i.e. can be split in groups of two) in such a way that the sum of each pair is a prime number. Prove that these prime numbers are distinct and that none of these are a divisor of $n.$

In a ballroom dance class $15$ boys and $15$ girls are lined up in parallel rows so that $15$ couples are formed. It so happens that the difference in height between the boy and the girl in each couple is not more than $10$ cm. Prove that if the boys and the girls were placed in each line in order of decreasing height, then the difference in height in each of the newly formed couples would still be at most $10$ cm. (AG Pechkovskiy, Moscow)

In the land of Cockaigne, people play the following solitaire. It starts from a finite string of zeros and ones, and are granted the following moves: (i) cancel each two consecutive ones; (ii) delete three consecutive zeros; (iii) if the substring within the string is $01$, one may replace this by substring $100$. The moves (i), (ii) and (iii) must be made one at a time. You win if you can reduce the string to a string formed by two digits or less. (For example, starting from $0101$, one can win using move (iii) first in the last two digits, resulting in $01100$, then playing the move (i) on two 'ones', and finally the move (ii) on the three zeros, one will get the empty string.) Among all the $1024$ possible strings of ten-digit binary numbers, how many are there from which it is not possible to win the solitary?

Prove that for positive reals $a,b,c$ satisfying $a+b+c=3$ the following inequality holds: $$ \frac{a}{1+2b^3}+\frac{b}{1+2c^3}+\frac{c}{1+2a^3} \ge 1 $$

Let $ABCD$ be a convex quadrilateral inscribed in a circle of radius $1$. Prove that \[ 0< (AB+BC+CD+AD)-(AC+BD) < 4. \]

Show that $n$ is prime iff $\lim_{r \rightarrow\infty}\,\lim_{s \rightarrow\infty}\,\lim_{t \rightarrow \infty}\,\sum_{u=0}^{s}\left(1-\left(\cos\,\frac{(u!)^{r} \pi}{n} \right)^{2t} \right)=n$ PS : I posted it because it's in the PDF file but not here ...

Let be given an arbitrary tetrahedron $ABCD$ with volume $V$. Consider all lines which pass through the barycenter $S$ of the tetrahedron and intersect the edges $AD,BD,CD$ at points $A',B',C$ respectively. It is known that among the obtained tetrahedra there exists one with the minimal volume. Express this minimal volume in terms of $V$

Given $k \in \mathbb{Z}$ prove that there exist infinite pairs of distinct natural numbers such that \begin{align*} n+s(2n)=m+s(2m) \\ kn+s(n^2)=km+s(m^2). \end{align*} ($s(n)$ denotes the sum of digits of $n$.) [i]Proposed by Mohammadamin Sharifi[/i]

(a) Show that the equation \[\lfloor x \rfloor (x^2 + 1) = x^3,\] where $\lfloor x \rfloor$ denotes the largest integer not larger than $x$, has exactly one real solution in each interval between consecutive positive integers. (b) Show that none of the positive real solutions of this equation is rational.

In trapezoid $ABCD$, $AD$ is perpendicular to $DC$, $AD=AB=3$, and $DC=6$. In addition, E is on $DC$, and $BE$ is parallel to $AD$. Find the area of $\Delta BEC$. [asy] defaultpen(linewidth(0.7)); pair A=(0,3), B=(3,3), C=(6,0), D=origin, E=(3,0); draw(E--B--C--D--A--B); draw(rightanglemark(A, D, C)); label("$A$", A, NW); label("$B$", B, NW); label("$C$", C, SE); label("$D$", D, SW); label("$E$", E, NW); label("$3$", A--D, W); label("$3$", A--B, N); label("$6$", E, S);[/asy] $\textbf{(A)} \: 3\qquad \textbf{(B)} \: 4.5\qquad \textbf{(C)} \: 6\qquad \textbf{(D)} \: 9\qquad \textbf{(E)} \: 18\qquad $

Find all pair of constants $(a,b)$ such that there exists real-coefficient polynomial $p(x)$ and $q(x)$ that satisfies the condition below. [b]Condition[/b]: $\forall x\in \mathbb R,$ $ $ $p(x^2)q(x+1)-p(x+1)q(x^2)=x^2+ax+b$

Mark has a cursed six-sided die that never rolls the same number twice in a row, and all other outcomes are equally likely. Compute the expected number of rolls it takes for Mark to roll every number at least once.

Let $A_1A_2A_3$ be a triangle and $M$ an interior point. The straight lines $MA_1, MA_2, MA_3$ intersect the opposite sides at the points $B_1, B_2, B_3$ respectively (see Fig.). Show that if the areas of triangles $A_2B_1M, A_3B_2M$ and $A_1B_3M$ are equal, then $M$ coincides with the centroid of triangle $A_1A_2A_3$. [img]https://cdn.artofproblemsolving.com/attachments/1/7/b29bdbb1f2b103be1f3cb2650b3bfff352024a.png[/img]

[u]Round 1[/u] [b]p1.[/b] When Shiqiao sells a bale of kale, he makes $x$ dollars, where $$x =\frac{1 + 2 + 3 + 4 + 5 + 6 + 7 + 8}{3 + 4 + 5 + 6}.$$ Find $x$. [b]p2.[/b] The fraction of Shiqiao’s kale that has gone rotten is equal to $$\sqrt{ \frac{100^2}{99^2} -\frac{100}{99}}.$$ Find the fraction of Shiqiao’s kale that has gone rotten. [b]p3.[/b] Shiqiao is growing kale. Each day the number of kale plants doubles, but $4$ of his kale plants die afterwards. He starts with $6$ kale plants. Find the number of kale plants Shiqiao has after five days. [u]Round 2[/u] [b]p4.[/b] Today the high is $68$ degrees Fahrenheit. If $C$ is the temperature in Celsius, the temperature in Fahrenheit is equal to $1.8C + 32$. Find the high today in Celsius. [b]p5.[/b] The internal angles in Evan’s triangle are all at most $68$ degrees. Find the minimum number of degrees an angle of Evan’s triangle could measure. [b]p6.[/b] Evan’s room is at $68$ degrees Fahrenheit. His thermostat has two buttons, one to increase the temperature by one degree, and one to decrease the temperature by one degree. Find the number of combinations of $10$ button presses Evan can make so that the temperature of his room never drops below $67$ degrees or rises above $69$ degrees. [u]Round 3[/u] [b]p7.[/b] In a digital version of the SAT, there are four spaces provided for either a digit $(0-9)$, a fraction sign $(\/)$, or a decimal point $(.)$. The answer must be in simplest form and at most one space can be a non-digit character. Determine the largest fraction which, when expressed in its simplest form, fits within this space, but whose exact decimal representation does not. [b]p8.[/b] Rounding Rox picks a real number $x$. When she rounds x to the nearest hundred, its value increases by $2.71828$. If she had instead rounded $x$ to the nearest hundredth, its value would have decreased by $y$. Find $y$. [b]p9.[/b] Let $a$ and $b$ be real numbers satisfying the system of equations $$\begin{cases} a + \lfloor b \rfloor = 2.14 \\ \lfloor a \rfloor + b = 2.72 \end{cases}$$ Determine $a + b$. [u]Round 4[/u] [b]p10.[/b] Carol and Lily are playing a game with two unfair coins, both of which have a $1/4$ chance of landing on heads. They flip both coins. If they both land on heads, Lily loses the game, and if they both land on tails, Carol loses the game. If they land on different sides, Carol and Lily flip the coins again. They repeat this until someone loses the game. Find the probability that Lily loses the game. [b]p11.[/b] Dongchen is carving a circular coin design. He carves a regular pentagon of side length $1$ such that all five vertices of the pentagon are on the rim of the coin. He then carves a circle inside the pentagon so that the circle is tangent to all five sides of the pentagon. Find the area of the region between the smaller circle and the rim of the coin. [b]p12.[/b] Anthony flips a fair coin six times. Find the probability that at some point he flips $2$ heads in a row. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3248731p29808147]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let's call a ticket with a number from $000000$ to $999999$ [i]excellent [/i] if the difference between some two adjacent digits is $5$. Find the number of excellent tickets.

[4] Let $x_1,x_2,\ldots,x_{100}$ be defined so that for each $i$, $x_i$ is a (uniformly) random integer between $1$ and $6$ inclusive. Find the expected number of integers in the set $\{x_1,x_1+x_2,\ldots,x_1+x_2+\cdots+x_{100}\}$ that are multiples of $6$.

There are 20 buns with jam and 20 buns with treacle arranged in a row in random order. Alice and Bob take in turn a bun from any end of the row. Alice starts, and wants to finally obtain 10 buns of each type; Bob tries to prevent this. Is it true for any order of the buns that Alice can win no matter what are the actions of Bob? [i]Alexandr Gribalko[/i]