For fixed coprime positive integers $a,b$, define $n$ to be [i]bad[/i] if it is not of the form $$ax+by,\enspace x,y\in\mathbb N^*$$ Prove that there are finitely many bad positive integers. Also, find the sum of squares of them.

Let $\mathbb{N}^2$ denote the set of ordered pairs of positive integers. A finite subset $S$ of $\mathbb{N}^2$ is [i]stable[/i] if whenever $(x,y)$ is in $S$, then so are all points $(x',y')$ of $\mathbb{N}^2$ with both $x'\leq x$ and $y'\leq y$. Prove that if $S$ is a stable set, then among all stable subsets of $S$ (including the empty set and $S$ itself), at least half of them have an even number of elements. [i]Ashwin Sah and Mehtaab Sawhney[/i]

Find all functions $ f: \mathbb{R}\to\mathbb{R}$ that satisfy the equation: $ f\left(\left(f\left(x\right)\right)^2 \plus{} f\left(y\right)\right) \equal{} xf\left(x\right) \plus{} y$ for any two real numbers $ x$ and $ y$.

We want to find functions $p(t)$, $q(t)$, $f(t)$ such that (a) $p$ and $q$ are continuous functions on the open interval $(0,\pi)$. (b) $f$ is an infinitely differentiable nonzero function on the whole real line $(-\infty,\infty)$ such that $f(0)=f'(0)=f''(0)$. (c) $y=\sin t$ and $y=f(t)$ are solutions of the differential equation $y''+p(t)y'+q(t)y=0$ on $(0,\pi)$. Is this possible? Either prove this is not possible, or show this is possible by providing an explicit example of such $f,p,q$.

Suppose that the 32 computers in a certain network are numbered with the 5-bit integers $00000, 00001, 00010, ..., 11111$ (bit is short for binary digit). Suppose that there is a one-way connection from computer $A$ to computer $B$ if and only if $A$ and $B$ share four of their bits with the remaining bit being $0$ at $A$ and $1$ at $B$. (For example, $10101$ can send messages to $11101$ and to $10111$.) We say that a computer is at level $k$ in the network if it has exactly $k$ 1’s in its label $(k = 0, 1, 2, ..., 5)$. Suppose further that we know that $12$ computers, three at each of the levels $1$, $2$, $3$, and $4$, are malfunctioning, but we do not know which ones. Can we still be sure that we can send a message from $00000$ to $11111$?

A non-right triangle $A_1A_2A_3$ is given. Circles $C_1$ and $C_2$ are tangent at $A_3, C_2$ and $C_3$ are tangent at $A_1$, and $C_3$ and $C_1$ are tangent at $A_2$. Points $O_1,O_2,O_3$ are the centers of $C_1, C_2, C_3$, respectively. Supposing that the triangles $A_1A_2A_3$ and $O_1O_2O_3$ are similar, determine their angles.

It is known that for some $a$ and $b$ the equation $$\frac{x-3}{(x-6)^2} -\frac{x-6}{(x-3)^2} =a(b-9x+x^2)$$ has as its largest root the number $1995$. Find the smallest root of this equation for the same $a$ and $b$.

In a cyclic quadrilateral $ABCD$, the extensions of sides $AB$ and $CD$ meet at point $P$, and the extensions of sides $AD$ and $BC$ meet at point $Q$. Prove that the distance between the orthocenters of triangles $APD$ and $AQB$ is equal to the distance between the orthocenters of triangles $CQD$ and $BPC$.

In the following base-$10$ equation, each of the letter represents a unique digit: $AM\cdot PM=ZZZ$. Find the sum of $A+M+P+Z$. $\text{(A) }15\qquad\text{(B) }17\qquad\text{(C) }19\qquad\text{(D) }20\qquad\text{(E) }21$

Let $a,b,c$ be positive real numbers such that $a^2+b^2+c^2\geqslant 3$. Prove that \[\frac{a^2}{a+b^2}+\frac{b^2}{b+c^2}+\frac{c^2}{c+a^2}\geqslant\frac{3}{2}.\]

We are given $m\times n$ table tiled with $3\times 1$ stripes and we are given that $6 | mn$. Prove that there exists a tiling of the table with $2\times 1$ dominoes such that each of these stripes contains one whole domino.

38th Austrian Mathematical Olympiad 2007, round 3 problem 5 Given is a convex $ n$-gon with a triangulation, that is a partition into triangles through diagonals that don’t cut each other. Show that it’s always possible to mark the $ n$ corners with the digits of the number $ 2007$ such that every quadrilateral consisting of $ 2$ neighbored (along an edge) triangles has got $ 9$ as the sum of the numbers on its $ 4$ corners.

Real numbers $x$ and $y$ satisfy $$xy+\frac{x}{y} = 3$$ $$\frac{1}{x^2y^2}+\frac{y^2}{x^2} = 4$$ If $x^2$ can be expressed in the form $\frac{a+\sqrt{b}}{c}$ for integers $a$, $b$, and $c$. Find $a+b+c$. [i]Proposed by Andy Xu[/i]

How many pairs of integers $(m,n)$ are there such that $mn+n+14=\left (m-1 \right)^2$? $ \textbf{a)}\ 16 \qquad\textbf{b)}\ 12 \qquad\textbf{c)}\ 8 \qquad\textbf{d)}\ 6 \qquad\textbf{e)}\ 2 $

Find all continuous functions $f : \mathbb R \to \mathbb R$ such that: (a) $\lim_{x \to \infty}f(x)$ exists; (b) $f(x) = \int_{x+1}^{x+2}f(t) \, dt$, for all $x \in \mathbb R$.

Let $ABC$ be a triangle and $D$ a point inside the triangle, located on the median of $A$. Prove that if $\angle BDC = 180^o - \angle BAC$, then $AB \cdot CD = AC \cdot BD$.

What is the least value of $n$ such that $n!$ is a multiple of $2024$? $ \textbf{(A) }11 \qquad \textbf{(B) }21 \qquad \textbf{(C) }22 \qquad \textbf{(D) }23 \qquad \textbf{(E) }253 \qquad $

Consider the set $A=\{1,2,...,120\}$ and $M$ a subset of $A$ such that $|M|=30$.Prove that there are $5$ different subsets of $M$,each of them having two elements,such that the absolute value of the difference of the elements of each subset is the same.

A rectangular box has width $12$ inches, length $16$ inches, and height $\tfrac{m}{n}$ inches, where $m$ and $n$ are relatively prime positive integers. Three faces of the box meet at a corner of the box. The center points of those three faces are the vertices of a triangle with an area of $30$ square inches. Find $m+n$.

Let $a,b,c,d,e,f$ be positive real numbers. Given that $def+de+ef+fd=4$, show that \[ ((a+b)de+(b+c)ef+(c+a)fd)^2 \geq\ 12(abde+bcef+cafd). \][i]Proposed by Allen Liu[/i]

Find integers \(a\) and \(b\) such that \[a^b=3^0\binom{2020}{0}-3^1\binom{2020}{2}+3^2\binom{2020}{4}-\cdots+3^{1010}\binom{2020}{2020}.\] [i]proposed by the ICMC Problem Committee[/i]

A positive integer $n$ is called a good number if every integer multiple of $n$ is divisible by $n$ however its digits are rearranged. How many good numbers are there? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ \text{Infinitely many} $

Given a square $ABCD$ whose side length is $1$, $P$ and $Q$ are points on the sides $AB$ and $AD$. If the perimeter of $APQ$ is $2$ find the angle $PCQ$.

Find the number of pairs of integers $(a,b)$ with $0 \le a,b \le 2019$ where $ax \equiv b \pmod{2020}$ has exactly $2$ integer solutions $0 \le x \le 2019$. [i]Proposed by Richard Chen[/i]

The inequality $y-x<\sqrt{x^2}$ is satisfied if and only if $\textbf{(A) }y<0\text{ or }y<2x\text{ (or both inequalities hold)}\qquad$ $\textbf{(B) }y>0\text{ or }y<2x\text{ (or both inequalities hold)}\qquad$ $\textbf{(C) }y^2<2xy\qquad\textbf{(D) }y<0\qquad\textbf{(E) }x>0\text{ and }y<2x$