For finite sets $A,M$ such that $A \subseteq M \subset \mathbb{Z}^+$, we define $$f_M(A)=\{x\in M \mid x\text{ is divisible by an odd number of elements of }A\}.$$ Given a positive integer $k$, we call $M$ [i]k-colorable[/i] if it is possible to color the subsets of $M$ with $k$ colors so that for any $A \subseteq M$, if $f_M(A)\neq A$ then $f_M(A)$ and $A$ have different colors. Determine the least positive integer $k$ such that every finite set $M \subset\mathbb{Z}^+$ is k-colorable.

In a kindergarten, a nurse took $n$ congruent cardboard rectangles and gave them to $n$ kids, one per each. Each kid has cut its rectangle into congruent squares(the squares of different kids could be of different sizes). It turned out that the total number of the obtained squares is a prime number. Prove that all the initial squares were in fact squares.

Circle $\odot O$ with diameter $\overline{AB}$ has chord $\overline{CD}$ drawn such that $\overline{AB}$ is perpendicular to $\overline{CD}$ at $P$. Another circle $\odot A$ is drawn, sharing chord $\overline{CD}$. A point $Q$ on minor arc $\overline{CD}$ of $\odot A$ is chosen so that $\text{m} \angle AQP + \text{m} \angle QPB = 60^\circ$. Line $l$ is tangent to $\odot A$ through $Q$ and a point $X$ on $l$ is chosen such that $PX=BX$. If $PQ = 13$ and $BQ = 35$, find $QX$. [i]Proposed by Aaron Lin[/i]

Let \( f: \mathbb{R} \to \mathbb{R} \) be a differentiable function such that \( f(0) = 0 \) and \( 0 < f'(t) \leq 1 \) for all \( t \in [0, 1] \). Show that: \[ \left( \int_0^1 f(t) \, dt \right)^2 \geq \int_0^1 f(t)^3 \, dt. \]

Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$. Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.

Given a triangle $ABC$ with integer side lengths, where $BD$ is an angle bisector of $\angle ABC$, $AD=4$, $DC=6$, and $D$ is on $AC$, compute the minimum possible perimeter of $\triangle ABC$.

The natural numbers $p, q$ satisfy the relation $p^p + q^q = p^q + q^p$. Prove that $p = q$.

How many six-letter words formed from the letters of AMC do not contain the substring AMC? (For example, AMAMMC has this property, but AAMCCC does not.)

For all real numbers $x$, $x[x\{x(2-x)-4\}+10]+1=$ $\textbf{(A) }-x^4+2x^3+4x^2+10x+1$ $\textbf{(B) }-x^4-2x^3+4x^2+10x+1$ $\textbf{(C) }-x^4-2x^3-4x^2+10x+1$ $\textbf{(D) }-x^4-2x^3-4x^2-10x+1$ $\textbf{(E) }-x^4+2x^3-4x^2+10x+1$

What is the smallest positive odd integer having the same number of positive divisors as $360$?

Let $x, y, z \in R^+$. Prove that $$\frac{x}{x +\sqrt{(x + y)(x + z)}}+\frac{y}{y +\sqrt{(y + z)(y + x)}}+\frac{z}{z +\sqrt{(x + z)(z + y)}} \le 1$$

Find all integer solutions to the equation $$\frac{xyz}{w}+\frac{yzw}{x}+\frac{zwx}{y}+\frac{wxy}{z}=4$$

Camilla drove $20$ miles in the city at a constant speed and $40$ miles in the country at a constant speed that was $20$ miles per hour greater than her speed in the city. Her entire trip took one hour. Find the number of minutes that Camilla drove in the country rounded to the nearest minute.

Let $m_1< m_2 < \ldots m_{k-1}< m_k$ be $k$ distinct positive integers such that their reciprocals are in arithmetic progression. 1.Show that $k< m_1 + 2$. 2. Give an example of such a sequence of length $k$ for any positive integer $k$.

What is the sum of the last two digits of $7^{42} + 7^{43}$ in base $10$. $\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }8\qquad\text{(D) }9\qquad\text{(E) }11$

Vasya chose a certain number $x$ and calculated the following: $a_1=1+x^2+x^3, a_2=1+x^3+x^4, a_3=1+x^4+x^5, ..., a_n=1+x^{n+1}+x^{n+2} ,...$ It turned out that $a_2^2 = a_1a_3$. Prove that for all $n\ge 3$, the equality $a_n^2 = a_{n-1}a_{n+1}$ holds.

The internal bisectors of angles $\angle DAB$ and $\angle BCD$ of a quadrilateral $ABCD$ intersect at the point $X_1$, and the external bisectors of these angles intersect at the point $X_2$. The internal bisectors of angles $\angle ABC$ and $\angle CDA$ intersect at the point $Y_1$, and the external bisectors of these angles intersect at the point $Y_2$. Prove that the angle between the lines $X_1X_2$ and $Y_1Y_2$ equals the angle between the diagonals $AC$ and $BD$. [i](A. Voidelevich)[/i]

let $ABC$ be a right angled triangle with inradius $1$ find the minimum area of triangle $ABC$

Find all pairs $(a,\, b)$ of positive integers such that $2a-1$ and $2b+1$ are coprime and $a+b$ divides $4ab+1.$

Let $N$ be the fifth largest number that can be created by combining $2021$ $1$'s using addition, multiplication, and exponentiation, in any order (parentheses are allowed). If $f(x)=\log_2(x)$, and $k$ is the least positive integer such that $f^k(N)$ is not a power of $2$, what is the value of $f^k(N)$? (Note: $f^k(N)=f(f(\cdots(f(N))))$, where $f$ is applied $k$ times.) [i]Proposed by Adam Bertelli[/i]

If $f(x + y) = f(xy)$ for all real numbers $x$ and $y$, and $f(2019) = 17$, what is the value of $f(17)$?

Two lines intersect inside a unit square, splitting it into four regions. Find the maximum product of the areas of the four regions. [i]Proposed by Nathan Ramesh

Define the sequence $ a_1, a_2, a_3, ...$ as follows. $ a_1$ and $ a_2$ are coprime positive integers and $ a_{n \plus{} 2} \equal{} a_{n \plus{} 1}a_n \plus{} 1$. Show that for every $ m > 1$ there is an $ n > m$ such that $ a_m^m$ divides $ a_n^n$. Is it true that $ a_1$ must divide $ a_n^n$ for some $ n > 1$?

Peer and Solveig are playing a game with $n$ coins, all of which show $M$ on one side and $K$ on the opposite side. The coins are laid out in a row on the table. Peer and Solveig alternate taking turns. On his turn, Peer may turn over one or more coins, so long as he does not turn over two adjacent coins. On her turn, Solveig picks precisely two adjacent coins and turns them over. When the game begins, all the coins are showing $M$. Peer plays first, and he wins if all the coins show $K$ simultaneously at any time. Find all $n\geqslant 2$ for which Solveig can keep Peer from winning.

Circle $C_0$ has radius $1$, and the point $A_0$ is a point on the circle. Circle $C_1$ has radius $r<1$ and is internally tangent to $C_0$ at point $A_0$. Point $A_1$ lies on circle $C_1$ so that $A_1$ is located $90^{\circ}$ counterclockwise from $A_0$ on $C_1$. Circle $C_2$ has radius $r^2$ and is internally tangent to $C_1$ at point $A_1$. In this way a sequence of circles $C_1,C_2,C_3,...$ and a sequence of points on the circles $A_1,A_2,A_3,...$ are constructed, where circle $C_n$ has radius $r^n$ and is internally tangent to circle $C_{n-1}$ at point $A_{n-1}$, and point $A_n$ lies on $C_n$ $90^{\circ}$ counterclockwise from point $A_{n-1}$, as shown in the figure below. There is one point $B$ inside all of these circles. When $r=\frac{11}{60}$, the distance from the center of $C_0$ to $B$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(6cm); real r = 0.8; pair nthCircCent(int n){ pair ans = (0, 0); for(int i = 1; i <= n; ++i) ans += rotate(90 * i - 90) * (r^(i - 1) - r^i, 0); return ans; } void dNthCirc(int n){ draw(circle(nthCircCent(n), r^n)); } dNthCirc(0); dNthCirc(1); dNthCirc(2); dNthCirc(3); dot("$A_0$", (1, 0), dir(0)); dot("$A_1$", nthCircCent(1) + (0, r), dir(135)); dot("$A_2$", nthCircCent(2) + (-r^2, 0), dir(0)); [/asy]