With three different digits, six-digit numbers are written, multiples of $3$. One of the the digits are in the unit's place, another in the hundred's place, and the third in the remaining places. If we take out two units from the hundred's digit and add these to the unit's digit, the number is left with all the same digits. Find the numbers.

Let $a_1,a_2,\dots$ be a sequence of positive numbers satisfying, for any positive integers $k,l,m,n$ such that $k+n=m+l$, $$\frac{a_k+a_n}{1+a_ka_n}=\frac{a_m+a_l}{1+a_ma_l}.$$Show that there exist positive numbers $b,c$ so that $b\le a_n\le c$ for any positive integer $n$.

Given a string of at least one character in which each character is either A or B, Kathryn is allowed to make these moves: [list] [*] she can choose an appearance of A, erase it, and replace it with BB, or [*] she can choose an appearance of B, erase it, and replace it with AA. [/list] Kathryn starts with the string A. Let $a_n$ be the number of strings of length $n$ that Kathryn can reach using a sequence of zero or more moves. (For example, $a_1=1$, as the only string of length 1 that Kathryn can reach is A.) Then $\sum_{n=1}^{\infty} \frac{a_n}{5^n} = \frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$. [i]Proposed by Luke Robitaille[/i]

How many distinct prime factors does the number $36$ have? $\textbf{(A) }2\qquad\textbf{(B) }4\qquad\textbf{(C) }6\qquad\textbf{(D) }9\qquad\textbf{(E) }15$

Let $\Gamma_1$ be a circle with radius $\frac{5}{2}$. $A$, $B$, and $C$ are points on $\Gamma_1$ such that $\overline{AB} = 3$ and $\overline{AC} = 5$. Let $\Gamma_2$ be a circle such that $\Gamma_2$ is tangent to $AB$ and $BC$ at $Q$ and $R$, and $\Gamma_2$ is also internally tangent to $\Gamma_1$ at $P$. $\Gamma_2$ intersects $AC$ at $X$ and $Y$. $[PXY]$ can be expressed as $\frac{a\sqrt{b}}{c}$. Find $a+b+c$. [i]2022 CCA Math Bonanza Individual Round #5[/i]

The $ 2^N$ vertices of the $ N$-dimensional hypercube $ \{0,1\}^N$ are labelled with integers from $ 0$ to $ 2^N \minus{} 1$, by, for $ x \equal{} (x_1,x_2,\ldots ,x_N)\in \{0,1\}^N$, \[v(x) \equal{} \sum_{k \equal{} 1}^{N}x_k2^{k \minus{} 1}.\] For which values $ n$, $ 2\leq n \leq 2^n$ can the vertices with labels in the set $ \{v|0\leq v \leq n \minus{} 1\}$ be connected through a Hamiltonian circuit, using edges of the hypercube only? [i]E. Bazavan & C. Talau[/i]

It is known that odd prime numbers $x, y z$ satisfy $$x|(y^5+1),y|(z^5+1),z|(x^5+1).$$ Find the minimum value of the product $xyz$.

A permutation of $\{1, 2, 3, \dots, 16\}$ is called \emph{blocksum-simple} if there exists an integer $n$ such that the sum of any $4$ consecutive numbers in the permutation is either $n$ or $n+1$. How many blocksum-simple permutations are there? [i]Proposed by Yannick Yao[/i]

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

2025 IMO leaders are discussing $100$ problems in a meeting. For each $i = 1, 2,\ldots , 100$, each leader will talk about the $i$-th problem for $i$-th minutes. The chair can assign one leader to talk about a problem of his choice, but he would have to wait for the leader to complete the entire talk of that problem before assigning the next leader and problem. The next leader can be the same leader. The next problem can be a different problem. Each leader’s longest idle time is the longest consecutive time that he is not talking. Find the minimum positive integer $T$ so that the chair can ensure that the longest idle time for any leader does not exceed $T$. [i]Proposed by usjl[/i]

Let $ABCDE$ be a convex pentagon such that $AB=BC=CD$, $\angle{EAB}=\angle{BCD}$, and $\angle{EDC}=\angle{CBA}$. Prove that the perpendicular line from $E$ to $BC$ and the line segments $AC$ and $BD$ are concurrent.

The point $D$ is the midpoint of the side $[AB]$ of the triangle $ABC$ . The points $E$ and $F$ belong to $[AC]$ and $[BC]$ respectively. Prove that the area of triangle $DEF$ area does not exceed the sum of the areas of triangles $ADE$ and $BDF$.

Polar coordinate equation of curve $C$ is $\rho=1+\cos\theta$. Polar coordinate of point $A$ is $(2,0)$. $C$ rotate around $A$ for a whole circle, the area of the figure that $C$ swept out by is________.

Compute the remainder when $\binom{205}{101}$ is divded by $101 \times 103$. [i]Proposed by Brandon Xu[/i]

Something related to this [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=845756#845756]problem[/url]: Prove that for a set $ S\subset\mathbb N$, there exists a sequence $ \{a_{i}\}_{i \equal{} 0}^{\infty}$ in $ S$ such that for each $ n$, $ \sum_{i \equal{} 0}^{n}a_{i}x^{i}$ is irreducible in $ \mathbb Z[x]$ if and only if $ |S|\geq2$. [i]By Omid Hatami[/i]

Consider all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying \[f(f(x) + 2x + 20) = 15. \] Call an integer $n$ $\textit{good}$ if $f(n)$ can take any integer value. In other words, if we fix $n$, for any integer $m$, there exists a function $f$ such that $f(n) = m.$ Find the sum of all good integers $x.$

Let $ p\ge 2 $ be a natural number that divides $ \binom{p}{k} , $ for any natural number $ k $ smaller than $ p. $ Prove that: [b]a)[/b] $ p $ is prime. [b]b)[/b] $ p^2 $ divides $ -2+\binom{2p}{p} . $

On a line are given $n$ blue and $n$ red points. Prove that the sum of distances between pairs of points of the same color does not exceed the sum of distances between pairs of points of different colors. (O. Musin)

Let $0<a<b$ and let $f:[a,b]\to\mathbb R$ be a continuous function with $\int^b_af(t)dt=0$. Show that $$\int^b_a\int^b_af(x)f(y)\ln(x+y)dxdy\le0.$$

A [i]police emergency number[/i] is a positive integer that ends with the digits $133$ in decimal representation. Prove that every police emergency number has a prime factor larger than $7$. (In Austria, $133$ is the emergency number of the police.) (Robert Geretschläger)

A table with $m$ rows and $n$ columns is given. At any move one chooses some empty cells such that any two of them lie in different rows and columns, puts a white piece in any of those cells and then puts a black piece in the cells whose rows and columns contain white pieces. The game is over if it is not possible to make a move. Find the maximum possible number of white pieces that can be put on the table.

Let $ABC$ be a scalene acute triangle, where $AL$ $(L \in BC)$ is the internal bisector of $\angle BAC$ and $M$ is the midpoint of $BC$. Let the internal bisectors of $\angle AMB$ and $\angle CMA$ intersect $AB$ and $AC$ in $P$ and $Q$, respectively. Prove that the circumcircle of $APQ$ is tangent to $BC$ if and only if $L$ belongs to it.

Prove that For all positive integers $m$ and $n$ , one has $| n \sqrt{2005} - m | > \frac{1}{90n}$

How many odd positive 3-digit integers are divisible by 3 but do not contain the digit 3? $\textbf{(A) } 96 \qquad \textbf{(B) } 97 \qquad \textbf{(C) } 98 \qquad \textbf{(D) } 102 \qquad \textbf{(E) } 120 $

Let $\mathbb Z$ be the set of all integers. Find all functions $f:\mathbb Z\to\mathbb Z$ satisfying the following conditions: 1. $f(f(x))=xf(x)-x^2+2$ for all $x\in\mathbb Z$; 2. $f$ takes all integer values. [i](I. Voronovich)[/i]