Alicia bought some number of disposable masks, of which she uses one per day. After she uses each of her masks, she throws out half of them (rounding up if necessary) and reuses each of the remaining masks, repeating this process until she runs out of masks. If her masks lasted her $222$ days, how many masks did she start out with?

Find all non-negative integer numbers $n$ for which there exists integers $a$ and $b$ such that $n^2=a+b$ and $n^3=a^2+b^2.$

Given two circles ${\omega _1},{\omega _2}$, $S$ denotes all $\Delta ABC$ satisfies that ${\omega _1}$ is the circumcircle of $\Delta ABC$, ${\omega _2}$ is the $A$- excircle of $\Delta ABC$ , ${\omega _2}$ touches $BC,CA,AB$ at $D,E,F$. $S$ is not empty, prove that the centroid of $\Delta DEF$ is a fixed point.

\[\int_{-2}^2 |1-x^2|\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Show that a finite group can not be the union of two of its proper subgroups. Does the statement remain true if "two' is replaced by "three'?

Let $\{x\}$ denote the fractional part of $x$, $x - [x]$. The sequences $x_1, x_2, x_3, ...$ and $y_1, y_2, y_3, ...$ are such that $\lim \{x_n\} = \lim \{y_n\} = 0$. Is it true that $\lim \{x_n + y_n\} = 0$? $\lim \{x_n - y_n\} = 0$?

The lengths of the four sides of an cyclic octagon are $4$ cm, the lengths of the other four sides are $6$ cm. Find the area of ​​the octagon.

Given a sequence of positive integers $a_1, a_2, a_3, \ldots$ such that for any positive integers $k$, $l$ we have $k+l ~ | ~ a_k + a_l$. Prove that for all positive integers $k > l$, $a_k - a_l$ is divisible by $k-l$.

Consider a rectangular table $2 \times n.$ Let every cell be dyed either by black or white color in a way that no $2\times 2$ square is completely black. Denote $P_n$ the number of such colorings. Prove that the number $P_{1989}$ is divisible by three and find the greatest power of three that divides them.

We are given a rectangular table with a positive integer written in each of its cells. For each cell of the table, the number in it is equal to the total number of different values in the cells that are in the same row or column (including itself). Find all tables with this property.

Let $d(m)$ denote the number of positive integer divisors of a positive integer $m$. If $r$ is the number of integers $n \leqslant 2023$ for which $\sum_{i=1}^{n} d(i)$ is odd. , find the sum of digits of $r.$

Prove that a natural number can be written as a sum of two or more consecutive positive integers if and only if that number is not a power of two.

Let $\frac{x^2+y^2}{x^2-y^2} + \frac{x^2-y^2}{x^2+y^2} = k$. Compute the following expression in terms of $k$: \[ E(x,y) = \frac{x^8 + y^8}{x^8-y^8} - \frac{ x^8-y^8}{x^8+y^8}. \] [i]Ciprus[/i]

Find two smallest natural numbers $n$ for which each of the fractions $\frac{68}{n+70},\frac{69}{n+71},\frac{70}{n+72},...,\frac{133}{n+135}$ is irreducible.

We deal $n-1$ cards in some way to $n$ people sitting around a table. From then on, in one move a person with at least $2$ cards gives one card to each of his/her neighbors. Prove that eventually a state will be reached where everyone has at most one card.

Find the number of four-element subsets of $\{1,2,3,4,\dots, 20\}$ with the property that two distinct elements of a subset have a sum of $16$, and two distinct elements of a subset have a sum of $24$. For example, $\{3,5,13,19\}$ and $\{6,10,20,18\}$ are two such subsets.

Let $ 0 < a_1 < a_2 < a_3 < ... < a_{10000} < 20000$ be integers such that $ gcd(a_i,a_j) < a_i, \forall i < j$ ; is $ 500 < a_1$ [i](always)[/i] true ? [i](own)[/i] :lol:

Suppose that $ABCD$ is a convex quadrilateral with no parallel sides. Make a parallelogram on each two consecutive sides. Show that among these $4$ new points, there is only one point inside the quadrilateral $ABCD$. by Morteza Saghafian

Find the minimun value of $\sum_{i=1}^{10} \sum_{j=1}^{10} \sum_{k=1}^{10}|k(x+y-10i)(3x-6y-36j)(19x+95y-95k)|$ , where $x,y$ are integers.

Several $good$ points, several $bad$ points and several segments are drawn in the plane. Each segment connects a $good$ point and a $bad$ one; at most $100$ segments begin at each point. We have paint of $200$ colors. One half of each segment is painted with one of these colors, and the other half with another one. Is it always possible to do it so that every two segments with common end are painted with four different colors? [i](M. Qi, X. Zhang)[/i]

In a football tournament there are n teams, with ${n \ge 4}$, and each pair of teams meets exactly once. Suppose that, at the end of the tournament, the final scores form an arithmetic sequence where each team scores ${1}$ more point than the following team on the scoreboard. Determine the maximum possible score of the lowest scoring team, assuming usual scoring for football games (where the winner of a game gets ${3}$ points, the loser ${0}$ points, and if there is a tie both teams get ${1}$ point).

Given a circle $ k $ and a point inside it $ H $. Inscribe a triangle in the circle such that this point $ H $ is the point of intersection of the triangle's altitudes.

Let $A$ be a point in the plane, and $\ell$ a line not passing through $A$. Evan does not have a straightedge, but instead has a special compass which has the ability to draw a circle through three distinct noncollinear points. (The center of the circle is [i]not[/i] marked in this process.) Additionally, Evan can mark the intersections between two objects drawn, and can mark an arbitrary point on a given object or on the plane. (i) Can Evan construct* the reflection of $A$ over $\ell$? (ii) Can Evan construct the foot of the altitude from $A$ to $\ell$? *To construct a point, Evan must have an algorithm which marks the point in finitely many steps. [i]Proposed by Zack Chroman[/i]

Find the number of positive integer pairs $1\leqslant a,b \leqslant 2027$ that satisfy \[ 2027 \mid a^6+b^5+b^2.\] (Note: For integers $a$ and $b$, the notation $a \mid b$ means that there is an integer $c$ such that $ac=b$.) [i]Proposed by Valentio Iverson, Indonesia[/i]

Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$. Find the number of intersections of the graphs of $$y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).$$