Let $\lfloor x\rfloor$ denote the greatest integer less than or equal to $x$. Let $m$ be a positive integer, $m\geq 3$. For every integer $i$ with $1\leq i\leq m$, let \[S_{m,i}=\left\{\left\lfloor\dfrac{2^m-1}{2^{i-1}}n-2^{m-i}+1\right\rfloor\,:\,n=1,2,3,\ldots\right\}.\] For example, for $m=3$, \begin{align*}S_{3,1}&=\{\lfloor 7n-3\rfloor\,:\,n=1,2,3,\ldots\} \\&=\{4,11,18,\ldots\}, \\S_{3,2}&=\left\{\left\lfloor\dfrac72n-1\right\rfloor\,:\,n=1,2,3,\ldots\right\} \\&=\{2,6,9,\ldots\}, \\S_{3,3}&=\left\{\left\lfloor\dfrac74n\right\rfloor\,:\,n=1,2,3,\ldots\right\} \\&=\{1,3,5,\ldots\}.\end{align*} Prove that for all $m\geq 3$, each positive integer occurs in exactly one of the sets $S_{m,i}$.

Define the sequence $a_n$ by the rule $$a_{n+1} =\left \lfloor \frac{a_n} 2 \right \rfloor + \left \lfloor \frac{a_n}3 \right \rfloor$$ for $n \in \{1, 2, 3, 4, 5, 6, 7\}$, where $\lfloor x \rfloor$ denotes the greatest integer not greater than $x$. If $a_8=8$, how many possible values are there for $a_1$ given that it is a positive integer? [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 10)[/i]

Find the largest natural number $ n$ for which there exist different sets $ S_1,S_2,\ldots,S_n$ such that: $ 1^\circ$ $ |S_i\cup S_j|\leq 2004$ for each two $ 1\leq i,j\le n$ and $ 2^\circ$ $ S_i\cup S_j\cup S_k\equal{}\{1,2,\ldots,2008\}$ for each three integers $ 1\le i<j<k\le n$.

(i) For positive integers $a<b$, let $M(a,b)=\frac{\Sigma^{b}_{k=a}\sqrt{k^2+3k+3}}{b-a+1}$. Calculate $[M(a,b)]$ (ii) Calculate $N(a,b)=\frac{\Sigma^{b}_{k=a}[\sqrt{k^2+3k+3}]}{b-a+1}$.

Let $M$ be a nonempty subset of $\mathbb Z^+$ such that for every element $x$ in $M,$ the numbers $4x$ and $\lfloor \sqrt x \rfloor$ also belong to $M.$ Prove that $M = \mathbb Z^+.$

Find the highest power of 3 dividing $\dbinom{666}{333}$.

Let $E$ be the set of all bijective mappings from $\mathbb R$ to $\mathbb R$ satisfying \[f(t) + f^{-1}(t) = 2t, \qquad \forall t \in \mathbb R,\] where $f^{-1}$ is the mapping inverse to $f$. Find all elements of $E$ that are monotonic mappings.

Prove that $\prod\limits_{k=0}^{n-1}{({{2}^{n}}-{{2}^{k}})}$ is divisible by $n!$ for all positive integers $n$.

For a positive real number $\alpha$, define \[S(\alpha)=\{ \lfloor n\alpha\rfloor \; \vert \; n=1,2,3,\cdots \}.\] Prove that $\mathbb{N}$ cannot be expressed as the disjoint union of three sets $S(\alpha)$, $S(\beta)$, and $S(\gamma)$.

A ray of light originates from point $A$ and and travels in a plane, being reflected $n$ times between lines $AD$ and $CD$, before striking a point $B$ (which may be on $AD$ or $CD$) perpendicularly and retracing its path to $A$. (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for $n = 3.$) If $\measuredangle CDA = 8^\circ$, what is the largest value $n$ can have? $\text{(A)} \ 6 \qquad \text{(B)} \ 10 \qquad \text{(C)} \ 38 \qquad \text{(D)} \ 98 \qquad \text{(E)} \ \text{There is no largest value.}$

Consider a $m\times n$ rectangular grid with $m$ rows and $n$ columns. There are water fountains on some of the squares. A water fountain can spray water onto any of it's adjacent squares, or a square in the same column such that there is exactly one square between them. Find the minimum number of fountains such that each square can be sprayed in the case that a) $m=4$; b) $m=3$.

Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that \[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\] where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$

Given an integer $n \geq 2$ determine the integral part of the number $ \sum_{k=1}^{n-1} \frac {1} {({1+\frac{1} {n}}) \dots ({1+\frac {k} {n})}}$ - $\sum_{k=1}^{n-1} (1-\frac {1} {n}) \dots(1-\frac{k}{n})$

Let $f:[-1,1]\rightarrow\mathbb{R}$ be a continuous function. Show that: a) if $\int_0^1 f(\sin (x+\alpha ))\, dx=0$, for every $\alpha\in\mathbb{R}$, then $f(x)=0,\ \forall x\in [-1,1]$. b) if $\int_0^1 f(\sin (nx))\, dx=0$, for every $n\in\mathbb{Z}$, then $f(x)=0,\ \forall x\in [-1,1]$.

Write using with the floor function: the last, the second last, and the first digit of the number $n$ written in the decimal system.

Consider the sequence $a(n)$ defined by the following conditions:$$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.) (A Andjans)

A positive integer $n$ is [i]magical[/i] if $\lfloor \sqrt{\lceil \sqrt{n} \rceil} \rfloor=\lceil \sqrt{\lfloor \sqrt{n} \rfloor} \rceil$. Find the number of magical integers between $1$ and $10,000$ inclusive.

The Ultimate Question is a 10-part problem in which each question after the first depends on the answer to the previous problem. As in the Short Answer section, the answer to each (of the 10) problems is a nonnegative integer. You should submit an answer for each of the 10 problems you solve (unlike in previous years). In order to receive credit for the correct answer to a problem, you must also correctly answer $\textit{every one}$ $\textit{of the previous parts}$ $\textit{of the Ultimate Question}$.

For each positive integer $n$ let $a_n$ be the largest positive integer satisfying \[(a_n)!\left| \prod_{k=1}^n \left\lfloor \frac{n}{k}\right\rfloor\right.\] Show that there are infinitely many positive integers $m$ for which $a_{m+1}<a_m$.

Let $ABC$ be an acute-angled triangle such that $\angle{ACB} = 45^{\circ}$. Let $G$ be the point of intersection of the three medians and let $O$ be the circumcentre. Suppose $OG=1$ and $OG \parallel BC$. Determine the length of the segment $BC$.

Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation \[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\] that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$

Find all positive integers $n$ such that $n+ \left[ \frac{n}{6} \right] \ne \left[ \frac{n}{2} \right] + \left[ \frac{2n}{3} \right]$

A network is a simple directed graph such that each edge $ e$ has two intger lower and upper capacities $ 0\leq c_l(e)\leq c_u(e)$. A circular flow on this graph is a function such that: 1) For each edge $ e$, $ c_l(e)\leq f(e)\leq c_u(e)$. 2) For each vertex $ v$: \[ \sum_{e\in v^\plus{}}f(e)\equal{}\sum_{e\in v^\minus{}}f(e)\] a) Prove that this graph has a circular flow, if and only if for each partition $ X,Y$ of vertices of the network we have: \[ \sum_{\begin{array}{c}{e\equal{}xy}\\{x\in X,y\in Y}\end{array}} c_l(e)\leq \sum_{\begin{array}{c}{e\equal{}yx}\\{y\in Y,x\in X}\end{array}} c_l(e)\] b) Suppose that $ f$ is a circular flow in this network. Prove that there exists a circular flow $ g$ in this network such that $ g(e)\equal{}\lfloor f(e)\rfloor$ or $ g(e)\equal{}\lceil f(e)\rceil$ for each edge $ e$.

What is the maximum number of checkers it is possible to put on a $ n \times n$ chessboard such that in every row and in every column there is an even number of checkers?

Find the number of 5-digit numbers that each contains the block '15' and is divisible by 15.