Find the number of ordered triples of sets $(T_1, T_2, T_3)$ such that 1. each of $T_1, T_2$, and $T_3$ is a subset of $\{1, 2, 3, 4\}$, 2. $T_1 \subseteq T_2 \cup T_3$, 3. $T_2 \subseteq T_1 \cup T_3$, and 4. $T_3\subseteq T_1 \cup T_2$.

Consider triangle $ABC$ with $AB = AC$ and $\angle A = 40 ^o$. The points $S$ and $T$ are on the sides $AB$ and $BC$, respectively, so that $\angle BAT = \angle BCS= 10 ^o$. The lines $AT$ and $CS$ intersect at point $P$. Prove that $BT = 2PT$.

Find all triplets of integers $(a, b, c)$, that verify the equation $$|a+3|+b^2+4\cdot c^2-14\cdot b-12\cdot c+55=0.$$

For a positive integer $n$, let $f(n)$ be the number obtained by writing $n$ in binary and replacing every 0 with 1 and vice versa. For example, $n=23$ is 10111 in binary, so $f(n)$ is 1000 in binary, therefore $f(23) =8$. Prove that \[\sum_{k=1}^n f(k) \leq \frac{n^2}{4}.\] When does equality hold? (Proposed by Stephan Wagner, Stellenbosch University)

Nine distinct light bulbs are placed in a circle, each of which is off. Determine the number of ways to turn on some of the light bulbs in the circle such that no four consecutive bulbs are all off.

Suppose that the rational numbers $a, b$ and $c$ are the roots of the equation $x^3+ax^2 + bx + c = 0$. Find all such rational numbers $a, b$ and $c$. Justify your answer

Jesse has ten squares, which are labeled $1, 2, \dots, 10$. In how many ways can he color each square either red, green, yellow, or blue such that for all $1 \le i < j \le 10$, if $i$ divides $j$, then the $i$-th and $j$-th squares have different colors?

For positive integers $i$ and $N$, let $k_{N,i}$ be the $i$th smallest positive integer such that the polynomial $\frac{x^2}{2023} + \frac{N_x}{7} - k_{N,i}$ has integer roots. Compute the minimum positive integer $N$ satisfying the condition $\frac{k_{N,2023}}{k_{N,1000}}< 3$. Submit your answer as a positive integer $E$. If the correct answer is $A$, your score for this question will be $\max \left( 0, 25 \min \left( \frac{A}{E} , \frac{E}{A}\right)^{\frac32}\right)$, rounded to the nearest integer.

Is it possible to arrange natural numbers 1 to 8 on vertices of a cube such that each number divides sum of the three numbers sharing an edge with it?

Let $p$ be a prime. Prove that any complete graph with $1000p$ vertices, whose edges are labelled with integers, has a cycle whose sum of labels is divisible by $p$.

Let $a,b,c,d$ be the area of four faces of a tetrahedron, satisfying $a+b+c+d=1$. Show that $$\sqrt[n]{a^n+b^n+c^n}+\sqrt[n]{b^n+c^n+d^n}+\sqrt[n]{c^n+d^n+a^n}+\sqrt[n]{d^n+a^n+b^n} \le 1+\sqrt[n]{2}$$ holds for all positive integers $n$.

A natural number $n$ is said to be [i]abundant [/i] if the sum of its divisors is greater than $2n$. For example, $18$ is abundant because the sum of its divisors, $1 + 2 + 3 + 6 + 9 + 18$, is greater than $36$. Write every even number greater than $46$ as a sum of two numbers abundant.

In the quadrilateral $ABCD$, $AD$ is parallel to $BC$. $K$ is a point on $AB$. Draw the line through $A$ parallel to $KC$ and the line through $B$ parallel to $KD$. Prove that these two lines intersect at some point on $CD$.

Let $ABCD$ be a trapezoid such that $AB \parallel CD, \angle{BAC}=25^\circ, \angle{ABC}=125^\circ,$ and $AB+AD=CD.$ Compute $\angle{ADC}.$

Given finitely many open half planes on the Euclidean plane. The boundary lines of these half planes divide the plane into convex domains. Find a polynomial $C(q)$ of degree two so that the following holds: for any $q\ge 1$ integer, if the half planes cover each point of the plane at least $q$ times, then the set of points covered exactly $q$ times is the union of at most $C(q)$ domains. (translated by L. Erdős)

In the $3\times5$ grid shown, fill in each empty box with a two-digit positive integer such that: [list][*]no number appears in more than one box, and [*] for each of the $9$ lines in the grid consisting of three boxes connected by line segments, the box in the middle of the line contains the least common multiple of the numbers in the two boxes on the line.[/list] You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] import graph; size(7cm); real labelscalefactor = 0.5; pen dps = linewidth(0.8) + fontsize(14); defaultpen(dps); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((2,0)--(3,0)--(3,1)--(2,1)--cycle); draw((4,0)--(5,0)--(5,1)--(4,1)--cycle); draw((6,0)--(7,0)--(7,1)--(6,1)--cycle); draw((8,0)--(9,0)--(9,1)--(8,1)--cycle); draw((0,2)--(1,2)--(1,3)--(0,3)--cycle); draw((0,4)--(1,4)--(1,5)--(0,5)--cycle); draw((2,2)--(3,2)--(3,3)--(2,3)--cycle); draw((2,4)--(3,4)--(3,5)--(2,5)--cycle); draw((4,4)--(5,4)--(5,5)--(4,5)--cycle); draw((4,2)--(5,2)--(5,3)--(4,3)--cycle); draw((6,2)--(7,2)--(7,3)--(6,3)--cycle); draw((6,4)--(7,4)--(7,5)--(6,5)--cycle); draw((8,4)--(9,4)--(9,5)--(8,5)--cycle); draw((8,2)--(9,2)--(9,3)--(8,3)--cycle); draw((0.5,1)--(0.5,2)); draw((0.5,3)--(0.5,4)); draw((1,4)--(2,3)); draw((2.5,1)--(2.5,2)); draw((2.5,3)--(2.5,4)); draw((3,4)--(4,3)); draw((3,2)--(4,1)); draw((4.5,1)--(4.5,2)); draw((4.5,3)--(4.5,4)); draw((5,4.5)--(6,4.5)); draw((7,4.5)--(8,4.5)); draw((5,4)--(6,3)); draw((7,2)--(8,1)); draw((5,2)--(6,1)); draw((5,0.5)--(6,0.5)); draw((7,0.5)--(8,0.5)); draw((8.5,1)--(8.5,2)); draw((8.5,3)--(8.5,4)); label("$4$",(4.5, 0.5)); label("$9$",(8.5, 4.5)); [/asy]

Say that a positive integer is MPR (Math Prize Resolvable) if it can be represented as the sum of a 4-digit number MATH and a 5-digit number PRIZE. (Different letters correspond to different digits. The leading digits M and P can't be zero.) Say that a positive integer is MPRUUD (Math Prize Resolvable with Unique Units Digits) if it is MPR and the set of units digits $\{ \mathrm{H}, \mathrm{E} \}$ in the definition of MPR can be uniquely identified. Find the smallest positive integer that is MPR but not MPRUUD.

Let a triangle $ABC$ be given. Two circles passing through $A$ touch $BC$ at points $B$ and $C$ respectively. Let $D$ be the second common point of these circles ($A$ is closer to $BC$ than $D$). It is known that $BC = 2BD$. Prove that $\angle DAB = 2\angle ADB.$

Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which \[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\] Find the number of elements of the set $A_n$. [i]Proposed by Vidan Govedarica, Serbia[/i]

Quadrilateral $ABCD$ is inscribed on circle $O$. $AC\cap BD=P$. Circumcenters of $\triangle ABP,\triangle BCP,\triangle CDP,\triangle DAP$ are $O_1,O_2,O_3,O_4$. Prove that $OP,O_1O_3,O_2O_4$ share one point.

For each of $k=1,2,3,4,5$ find necessary and sufficient conditions on $a>0$ such that there exists a tetrahedron with $k$ edges length $a$ and the remainder length $1$.

Let $\vartriangle ABC$ be an acute triangle with angles $\angle BAC = 70^o$, $\angle ABC = 60^o$, let $D, E$ be the feet of perpendiculars from $B, C$ to $AC$, $AB$, respectively, and let $H$ be the orthocenter of $ABC$. Let $F$ be a point on the shorter arc $AB$ of circumcircle of $ABC$ satisfying $\angle F AB = 10^o$ and let $G$ be the foot of perpendicular from $H$ to $AF$. If $I = BF \cap EG$ and $J = CF \cap DG$, compute the angle $\angle GIJ$.

Determine all monic polynomials $ p(x)$ of fifth degree having real coefficients and the following property: Whenever $ a$ is a (real or complex) root of $ p(x)$, then so are $ \frac{1}{a}$ and $ 1\minus{}a$.

Suppose three circles of radius $5$ intersect at a common point. If the three (other) pairwise intersections between the circles form a triangle of area $ 8$, find the radius of the smallest possible circle containing all three circles.

Suppose that a polynomial of the form $p(x)=x^{2010}\pm x^{2009}\pm \cdots \pm x \pm 1$ has no real roots. What is the maximum possible number of coefficients of $-1$ in $p$?