A [i]triangulation[/i] $ \mathcal{T}$ of a polygon $ P$ is a finite collection of triangles whose union is $ P,$ and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side of $ P$ is a side of exactly one triangle in $ \mathcal{T}.$ Say that $ \mathcal{T}$ is [i]admissible[/i] if every internal vertex is shared by $ 6$ or more triangles. For example [asy] size(100); dot(dir(-100)^^dir(230)^^dir(160)^^dir(100)^^dir(50)^^dir(5)^^dir(-55)); draw(dir(-100)--dir(230)--dir(160)--dir(100)--dir(50)--dir(5)--dir(-55)--cycle); pair A = (0,-0.25); dot(A); draw(A--dir(-100)^^A--dir(230)^^A--dir(160)^^A--dir(100)^^A--dir(5)^^A--dir(-55)^^dir(5)--dir(100)); [/asy] Prove that there is an integer $ M_n,$ depending only on $ n,$ such that any admissible triangulation of a polygon $ P$ with $ n$ sides has at most $ M_n$ triangles.

What is the least positive integer $n$ such that $\overbrace{f(f(\dots f}^{21 \text{ times}}(n)))=2013$ where $f(x)=x+1+\lfloor \sqrt x \rfloor$? ($\lfloor a \rfloor$ denotes the greatest integer not exceeding the real number $a$.) $ \textbf{(A)}\ 1214 \qquad\textbf{(B)}\ 1202 \qquad\textbf{(C)}\ 1186 \qquad\textbf{(D)}\ 1178 \qquad\textbf{(E)}\ \text{None of above} $

For any $a>0$,set $\mathcal{S}(a)=\{\lfloor{na}\rfloor|n\in \mathbb{N}\}$. Show that there are no three positive reals $a,b,c$ such that \[ \mathcal{S}(a)\cap \mathcal{S}(b)=\mathcal{S}(b)\cap \mathcal{S}(c)=\mathcal{S}(c)\cap \mathcal{S}(a)=\emptyset \] \[ \mathcal{S}(a)\cup \mathcal{S}(b)\cup \mathcal{S}(c)=\mathbb{N} \]

Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square. [i]Proposed by Ilir Snopce[/i]

Divide the plane into an infinite square grid by drawing all the lines $x=m$ and $y=n$ for $m,n \in \mathbb Z$. Next, if a square's upper-right corner has both coordinates even, color it black; otherwise, color it white (in this way, exactly $1/4$ of the squares are black and no two black squares are adjacent). Let $r$ and $s$ be odd integers, and let $(x,y)$ be a point in the interior of any white square such that $rx-sy$ is irrational. Shoot a laser out of this point with slope $r/s$; lasers pass through white squares and reflect off black squares. Prove that the path of this laser will form a closed loop.

Find necessary and sufficient conditions on positive integers $m$ and $n$ so that \[\sum_{i=0}^{mn-1}(-1)^{\lfloor i/m\rfloor+\lfloor i/n\rfloor}=0.\]

For a real number $a$, $[a]$ denotes the largest integer not exceeding $a$. Find all positive real numbers $x$ satisfying the equation $$x\cdot [x]+2022=[x^2]$$

For each real number $ x$< let $ \lfloor x \rfloor$ be the integer satisfying $ \lfloor x \rfloor \le x < \lfloor x \rfloor \plus{}1$ and let $ \{x\}\equal{}x\minus{}\lfloor x \rfloor$. Let $ c$ be a real number such that \[ \{n\sqrt{3}\}>\dfrac{c}{n\sqrt{3}}\] for all positive integers $ n$. Prove that $ c \le 1$.

For every integer $n>2$, prove the equality $$\left\lfloor\frac{n(n+1)}{4n-2}\right\rfloor=\left\lfloor\frac{n+1}4\right\rfloor.$$

Let $a_0, a_1, a_2,\ldots $ be a sequence of real numbers satisfying $a_0=1$ and $a_n=a_{\lfloor 7n/9\rfloor}+a_{\lfloor n/9\rfloor}$ for $n=1, 2,\ldots $ Prove that there exists a positive integer $k$ with $a_k<\frac{k}{2001!}$.

Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$. [i]Evan O' Dorney.[/i]

Prove that for any integer $n$ one can find integers $a$ and $b$ such that \[n=\left[ a\sqrt{2}\right]+\left[ b\sqrt{3}\right] \]

Find the integer $n \ge 48$ for which the number of trailing zeros in the decimal representation of $n!$ is exactly $n-48$. [i]Proposed by Kevin Sun[/i]

suppose that $\mathcal F\subseteq X^{(K)}$ and $|X|=n$. we know that for every three distinct elements of $\mathcal F$ like $A,B$ and $C$ we have $A\cap B \not\subset C$. a)(10 points) Prove that : \[|\mathcal F|\le \dbinom{k}{\lfloor\frac{k}{2}\rfloor}+1\] b)(15 points) if elements of $\mathcal F$ do not necessarily have $k$ elements, with the above conditions show that: \[|\mathcal F|\le \dbinom{n}{\lceil\frac{n-2}{3}\rceil}+2\]

For each positive integer $n$ we consider the function $f_{n}:[0,n]\rightarrow{\mathbb{R}}$ defined by $f_{n}(x)=\arctan{\left(\left\lfloor x\right\rfloor \right)} $, where $\left\lfloor x\right\rfloor $ denotes the floor of the real number $x$. Prove that $f_{n}$ is a Riemann Integrable function and find $\underset{n\rightarrow\infty}{\lim}\frac{1}{n}\int_{0}^{n}f_{n}(x)\mathrm{d}x.$

The sequences $a_n$ and $b_n$ members are the last digits of $[\sqrt{10}^n]$ and $[\sqrt{2}^n]$ respectively (here $[ ...]$ denotes the whole part of a number). Are those sequences periodical?

A function $f$ is defined for all real numbers and satisfies \[f(2 + x) = f(2 - x)\qquad\text{and}\qquad f(7 + x) = f(7 - x)\] for all real $x$. If $x = 0$ is a root of $f(x) = 0$, what is the least number of roots $f(x) = 0$ must have in the interval $-1000 \le x \le 1000$?

Prove that for all $n\in\mathbb{Z}^+$, we have \[ \sum\limits_{p=1}^n\sum\limits_{q=1}^p\left\lfloor -\frac{1+\sqrt{8q+(2p-1)^2}}{2}\right\rfloor =-\frac{n(n+1)(n+2)}{3} \]

Suppose $a$ is a real number such that $3a + 6$ is the greatest integer less than or equal to $a$ and $4a + 9$ is the least integer greater than or equal to $a$. Compute $a$.

Let $ \lfloor x \rfloor$ be the greatest integer less than or equal to $ x$. Then the number of real solutions to $ 4x^2 \minus{} 40 \lfloor x \rfloor \plus{} 51 \equal{} 0$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Let $k, M$ be positive integers such that $k-1$ is not squarefree. Prove that there exist a positive real $\alpha$, such that $\lfloor \alpha\cdot k^n \rfloor$ and $M$ are coprime for any positive integer $n$.

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

Let $T=\text{TNFTPP}$. For natural numbers $k,n\geq 2$, we define $S(k,n)$ such that \[S(k,n)=\left\lfloor\dfrac{2^{n+1}+1}{2^{n-1}+1}\right\rfloor+\left\lfloor\dfrac{3^{n+1}+1}{3^{n-1}+1}\right\rfloor+\cdots+\left\lfloor\dfrac{k^{n+1}+1}{k^{n-1}+1}\right\rfloor.\] Compute the value of $S(10,T+55)-S(10,55)+S(10,T-55)$.

For any real $ x$, let $ \lfloor x\rfloor$ be the largest integer that is not more than $ x$. Given a sequence of positive integers $ a_1,a_2,a_3,\ldots$ such that $ a_1>1$ and \[ \left\lfloor\frac{a_1\plus{}1}{a_2}\right\rfloor\equal{}\left\lfloor\frac{a_2\plus{}1}{a_3}\right\rfloor\equal{}\left\lfloor\frac{a_3\plus{}1}{a_4}\right\rfloor\equal{}\cdots\] Prove that \[ \left\lfloor\frac{a_n\plus{}1}{a_{n\plus{}1}}\right\rfloor\leq1\] holds for every positive integer $ n$.

Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.