Let $a, b$ be positive real numbers such that there exist infinite number of natural numbers $k$ such that $\lfloor a^k \rfloor + \lfloor b^k \rfloor = \lfloor a \rfloor ^k + \lfloor b \rfloor ^k$ . Prove that $\lfloor a^{2014} \rfloor + \lfloor b^{2014} \rfloor = \lfloor a \rfloor ^{2014} + \lfloor b \rfloor ^{2014}$

Consider rectangle $ABCD$ with $AB=30$ and $BC=60$. Construct circle $T$ whose diameter is $AD$. Construct circle $S$ whose diameter is $AB$. Let circles $S$ and $T$ intersect at $P$ such that $P\neq A$. Let $AP$ intersect $BC$ at $E$. Let $F$ be the point on $AB$ such that $EF$ is tangent to the circle with diameter $AD$. Find the area of triangle $AEF$.

Let $a$, $b$ and $c$ be real numbers with $0 \le a, b, c \le 2$. Prove that $$(a - b)(b - c)(a- c) \le 2.$$ When does equality hold? [i](Karl Czakler)[/i]

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Prove that all subsets of a finite set can be arranged in a sequence in which every two successive subsets differ in exactly one element.

A Bluetooth device can connect to any other Bluetooth device that is not more than $10$ meters from him. A piconet is called a bluetooth network consisting of one master and a plurality of connected slaves. What is the greatest number of slaves, what can be on the pickup provided that all devices are on the same level and all slaves are out of range of each other?

The altitudes $AA_1$ and $CC_1$ of an acute-angled triangle $ABC$ intersect at point $H$. A straight line passing through $H$ parallel to line $A_1C_1$ intersects the circumscribed circles of triangles $AHC_1$ and $CHA_1$ at points $X$ and $Y$, respectively. Prove that points $X$ and $Y$ are equidistant from the midpoint of segment $BH$.

The set of numbers $(p, a, b, c)$ of positive integers is called [i]Sozopolian[/i] when: [b]* [/b]p is an odd prime number [b]*[/b] $a$, $b$ and $c$ are different and [b]*[/b] $ab + 1$, $bc + 1$ and $ca + 1$ are a multiple of $p$. a) Prove that each [i]Sozopolian[/i] set satisfies the inequality $p+2 \leq \frac{a+b+c}{3}$ b) Find all numbers $p$ for which there exist a [i]Sozopolian[/i] set for which the equality of the upper inequation is met.

How many $2 \times 2 \times 2$ cubes must be added to a $8 \times 8 \times 8$ cube to form a $12 \times 12 \times 12$ cube? [i]Proposed by Evan Chen[/i]

Let $n$ be a positive integer. Show that there is a prime $p$ and a sequence $\left(a_k\right)_{k\ge1}$ of positive integers such that the sequence $\left(p+na_k\right)_{k\ge1}$ consists of distinct primes.

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

The equation of line $\ell_1$ is $24x-7y = 319$ and the equation of line $\ell_2$ is $12x-5y = 125$. Let $a$ be the number of positive integer values $n$ less than $2023$ such that for both $\ell_1$ and $\ell_2$ there exists a lattice point on that line that is a distance of $n$ from the point $(20,23)$. Determine $a$. [i]Proposed by Christopher Cheng[/i] [hide=Solution][i]Solution. [/i] $\boxed{6}$ Note that $(20,23)$ is the intersection of the lines $\ell_1$ and $\ell_2$. Thus, we only care about lattice points on the the two lines that are an integer distance away from $(20,23)$. Notice that $7$ and $24$ are part of the Pythagorean triple $(7,24,25)$ and $5$ and $12$ are part of the Pythagorean triple $(5,12,13)$. Thus, points on $\ell_1$ only satisfy the conditions when $n$ is divisible by $25$ and points on $\ell_2$ only satisfy the conditions when $n$ is divisible by $13$. Therefore, $a$ is just the number of positive integers less than $2023$ that are divisible by both $25$ and $13$. The LCM of $25$ and $13$ is $325$, so the answer is $\boxed{6}$.[/hide]

If $x$ and $y$ are non-zero real numbers such that \[ |x|+y=3 \qquad \text{and} \qquad |x|y+x^3=0, \] then the integer nearest to $x-y$ is $ \textbf{(A)}\ -3 \qquad\textbf{(B)}\ -1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 5 $

For $n=0,\ 1,\ 2,\ \cdots$, let $a_n=\int_{n}^{n+1} \{xe^{-x}-(n+1)e^{-n-1}(x-n)\}\ dx,$ $b_n=\int_{n}^{n+1} \{xe^{-x}-(n+1)e^{-n-1}\}\ dx.$ Find $\lim_{n\to\infty} \sum_{k=0}^n (a_k-b_k).$

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

Prove that the number $x^8+\frac{1}{x^8}$ is an integer if $x+\frac{1}{x }$ is an integer.

How many different real roots does the equation $x^2-5x-4\sqrt x + 13 = 0$ have? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $

Consider $\vartriangle A_0B_0C_0$ and points $C_1, A_1, B_1$ on its sides $A_0B_0, B_0C_0, C_0A_0$, points $C_2, A_2,B_2$ on the sides $A_1B_1, B_1C_1, C_1A_1$ of $\vartriangle A_1B_1C_1$, respectively, etc., so that $$\frac{A_0B_1}{B_1C_0}= \frac{B_0C_1}{C_1A_0}= \frac{C_0A_1}{A_1B_0}= k, \frac{A_1B_2}{B_2C_1}= \frac{B_1C_2}{C_2A_1}= \frac{C_1A_2}{A_2B_1}= \frac{1}{k^2}$$ and, in general, $$\frac{A_nB_{n+1}}{B_{n+1}C_n}= \frac{B_nC_{n+1}}{C_{n+1}A_n}= \frac{C_nA_{n+1}}{A_{n+1}B_n} =k^{2n}$$ for $n$ even , $\frac{1}{k^{2n}}$ for $n$ odd. Prove that $\vartriangle ABC$ formed by lines $A_0A_1, B_0B_1, C_0C_1$ is contained in $\vartriangle A_nB_nC_n$ for any $n$.

There are $n$ students in a class, and some pairs of these students are friends. Among any six students, there are two of them that are not friends, and for any pair of students that are not friends there is a student among the remaining four that is friends with both of them. Find the maximum value of $n$.

In the phrase given at the end of the condition of the problem, it is necessary to put a number (numeral) in place of the ellipsis, written in verbal form and in the required case, so that the statement formulated in it is true. Here is this phrase: “The number of letters in this phrase is...”

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$.

A square has coordinates at $(0, 0)$, $(4, 0)$, $(0, 4)$, and $(4, 4)$. Rohith is interested in circles of radius $ r$ centered at the point $(1, 2)$. There is a range of radii $a < r < b$ where Rohith’s circle intersects the square at exactly $6$ points, where $a$ and $b$ are positive real numbers. Then $b - a$ can be written in the form $m +\sqrt{n}$, where $m$ and $n$ are integers. Compute $m + n$.

A square with side length $8$ is colored white except for $4$ black isosceles right triangular regions with legs of length $2$ in each corner of the square and a black diamond with side length $2\sqrt{2}$ in the center of the square, as shown in the diagram. A circular coin with diameter $1$ is dropped onto the square and lands in a random location where the coin is completely contained within the square, The probability that the coin will cover part of the black region of the square can be written as $\frac{1}{196}(a+b\sqrt{2}+\pi)$, where $a$ and $b$ are positive integers. What is $a+b$? [asy] //Diagram by Samrocksnature draw((0,0)--(8,0)--(8,8)--(0,8)--(0,0)); fill((2,0)--(0,2)--(0,0)--cycle, black); fill((6,0)--(8,0)--(8,2)--cycle, black); fill((8,6)--(8,8)--(6,8)--cycle, black); fill((0,6)--(2,8)--(0,8)--cycle, black); fill((4,6)--(2,4)--(4,2)--(6,4)--cycle, black); filldraw(circle((2.6,3.31),0.47),gray); [/asy] $\textbf{(A) }64 \qquad \textbf{(B) }66 \qquad \textbf{(C) }68 \qquad \textbf{(D) }70 \qquad \textbf{(E) }72$

Find the minimum possible value of \[\left\lfloor \dfrac{a+b}{c}\right\rfloor+2 \left\lfloor \dfrac{b+c}{a}\right\rfloor+ \left\lfloor \dfrac{c+a}{b}\right\rfloor\] where $a,b,c$ are the sidelengths of a triangle. [i]Proposed by Nathan Ramesh

Solve in $R$ equation $[x] \cdot \{x\} = 2001 x$, where$ [ .]$ and $\{ .\}$ represent respectively the floor and the integer functions.