A graph $G$ with $n$ vertex is called [i]good [/i] if every vertex could be labelled with distinct positive integers which are less than or equal $\lfloor \frac{n^2}{4} \rfloor$ such that there exists a set of nonnegative integers $D$ with the following property: there exists an edge between $2$ vertices if and only if the difference of their labels is in $D$. Show that there exists a positive integer $N$ such that for every $n \ge N$, there exist a not-good graph with $n$ vertices.

Let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. Find the number of positive integers $m$ between $1$ and $2022$ inclusive such that \[ \left\lfloor \frac{3^m}{11} \right\rfloor \] is even.

Prove that in each year , the $13^{th}$ day of some month occurs on a Friday .

Denote by $\lfloor x\rfloor$ the greatest positive integer less than or equal to $x$. Let $m\ge2$ be an integer, and let $s$ be a real number between $0$ and $1$. Define an infinite sequence of real numbers $a_1, a_2, a_3,\ldots$ by setting $a_1 = s$ and $ak = ma_{k-1}-(m-1)\lfloor a_{k-1}\rfloor$ for all $k\ge2$. For example, if $m = 3$ and $s = \tfrac58$, then we get $a_1 = \tfrac58$, $a_2 = \tfrac{15}8$, $a_3 = \tfrac{29}8$, $a_4 = \tfrac{39}8$, and so on. Call the sequence $a_1, a_2, a_3,\ldots$ $\textbf{orderly}$ if we can find rational numbers $b, c$ such that $\lfloor a_n\rfloor = \lfloor bn + c\rfloor$ for all $n\ge1$. With the example above where $m = 3$ and $s = \tfrac58$, we get an orderly sequence since $\lfloor a_n\rfloor = \left\lfloor\tfrac{3n}2-\tfrac32\right\rfloor$ for all $n$. Show that if $s$ is an irrational number and $m\ge2$ is any integer, then the sequence $a_1, a_2, a_3,\ldots$ is $\textbf{not}$ an orderly sequence.

Solve the equation $x^3 - [x] = 3$.

Let $n \in \mathbb N$, $n \geq 2$. (a) Give an example of two matrices $A,B \in \mathcal M_n \left( \mathbb C \right)$ such that \[ \textrm{rank} \left( AB \right) - \textrm{rank} \left( BA \right) = \left\lfloor \frac{n}{2} \right\rfloor . \] (b) Prove that for all matrices $X,Y \in \mathcal M_n \left( \mathbb C \right)$ we have \[ \textrm{rank} \left( XY \right) - \textrm{rank} \left( YX \right) \leq \left\lfloor \frac{n}{2} \right\rfloor . \] [i]Ion Savu[/i]

Find all real $x$ such that $$\lfloor x \lceil x \rceil \rfloor = 2022.$$ Express your answer in interval notation.

For any integer $n\ge2$ evaluate the sum \[\sum_{k=1}^{n^2-1}\bigl\lfloor\sqrt k\bigr\rfloor.\]

Prove that the sequence $(a_n)$, where $$a_n=\sum_{k=1}^n\left\{\frac{\left\lfloor2^{k-\frac12}\right\rfloor}2\right\}2^{1-k},$$converges, and determine its limit as $n\to\infty$.

Find all ordered triples $(a,b,c)$ of positive reals that satisfy: $\lfloor a\rfloor bc=3,a\lfloor b\rfloor c=4$, and $ab\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

Let $x_1,x_2,\dots,x_{31}$ be real numbers. Then find the maximum value can $$\sum_{i,j=1,2,\dots,31, \; i\neq j}{\lceil x_ix_j \rceil }-30\left(\sum_{i=1,2,\dots,31}{\lfloor x_i^2 \rfloor } \right)$$ achieve. P.S.: For a real number $x$ we denote the smallest integer that does not subseed $x$ by $\lceil x \rceil$ and the biggest integer that does not exceed $x$ by $\lfloor x \rfloor$. For example $\lceil 2.7 \rceil=3$, $\lfloor 2.7 \rfloor=2$ and $\lfloor 4 \rfloor=\lceil 4 \rceil=4$

The number of digits in $4^{16} 5^{25}$ (when written in the usual base 10 form) is A. 31 B. 30 C. 29 D. 28 E. 27

Fix a positive integer $n\geq 2$. What is the lest value that the expression $$\bigg\lfloor\frac{x_2+x_3+\dots +x_n}{x_1}\bigg\rfloor + \bigg\lfloor\frac{x_1+x_3+\dots +x_n}{x_2}\bigg\rfloor +\dots +\bigg\lfloor\frac{x_1+x_2+\dots +x_{n-1}}{x_n}\bigg\rfloor$$ may achieve, where $x_1,x_2,\dots ,x_n$ are positive real numbers.

Let $p$ be a prime number and let $s$ be an integer with $0 < s < p.$ Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and \[ \left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p} \] if and only if $s$ is not a divisor of $p-1$. Note: For $x$ a real number, let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$, and let $\{x\} = x - \lfloor x \rfloor$ denote the fractional part of x.

Prove that the expression \[\frac{\gcd(m, n)}{n}{n \choose m}\] is an integer for all pairs of positive integers $(m, n)$ with $n \ge m \ge 1$.