For a real number $ a$, let $ \lfloor a \rfloor$ denominate the greatest integer less than or equal to $ a$. Let $ \mathcal{R}$ denote the region in the coordinate plane consisting of points $ (x,y)$ such that \[\lfloor x \rfloor ^2 \plus{} \lfloor y \rfloor ^2 \equal{} 25.\] The region $ \mathcal{R}$ is completely contained in a disk of radius $ r$ (a disk is the union of a circle and its interior). The minimum value of $ r$ can be written as $ \tfrac {\sqrt {m}}{n}$, where $ m$ and $ n$ are integers and $ m$ is not divisible by the square of any prime. Find $ m \plus{} n$.

Prove that there exists an infinite set of points \[ \dots, \; P_{-3}, \; P_{-2},\; P_{-1},\; P_0,\; P_1,\; P_2,\; P_3,\; \dots \] in the plane with the following property: For any three distinct integers $a,b,$ and $c$, points $P_a$, $P_b$, and $P_c$ are collinear if and only if $a+b+c=2014$.

Let $P$ be a point in a square whose side are mirror. A ray of light comes from $P$ and with slope $\alpha$. We know that this ray of light never arrives to a vertex. We make an infinite sequence of $0,1$. After each contact of light ray with a horizontal side, we put $0$, and after each contact with a vertical side, we put $1$. For each $n\geq 1$, let $B_{n}$ be set of all blocks of length $n$, in this sequence. a) Prove that $B_{n}$ does not depend on location of $P$. b) Prove that if $\frac{\alpha}{\pi}$ is irrational, then $|B_{n}|=n+1$.

A kangaroo jumps from lattice poin to lattice point in the coordinate plane. It can make only two kinds of jumps: $ (A)$ $ 1$ to right and $ 3$ up, and $ (B)$ $ 2$ to the left and $ 4$ down. $ (a)$ The start position of the kangaroo is $ (0,0)$. Show that it can jump to the point $ (19,95)$ and determine the number of jumps needed. $ (b)$ Show that if the start position is $ (1,0)$, then it cannot reach $ (19,95)$. $ (c)$ If the start position is $ (0,0)$, find all points $ (m,n)$ with $ m,n \ge 0$ which the kangaroo can reach.

Space is dissected into congruent cubes. Is it necessarily true that for each cube there exists another cube so that both cubes have a whole face in common?

A right triangle is inscribed in parabola $y=x^2$. Prove that it's hypotenuse is not less than $2$.

A circle moves so that it is continually in the contact with all three coordinate planes of an ordinary rectangular system. Find the locus of the center of the circle.

Let $n$ be a given positive integer. Solve the system \[x_1 + x_2^2 + x_3^3 + \cdots + x_n^n = n,\] \[x_1 + 2x_2 + 3x_3 + \cdots + nx_n = \frac{n(n+1)}{2}\] in the set of nonnegative real numbers.

A right parallelepiped (i.e. a parallelepiped one of whose edges is perpendicular to a face) is given. Its vertices have integral coordinates, and no other points with integral coordinates lie on its faces or edges. Prove that the volume of this parallelepiped is a sum of three perfect squares. [i]Proposed by A. Golovanov[/i]

A lattice point in an $xy$-coordinate system is any point $(x,y)$ where both $x$ and $y$ are integers. The graph of $y=mx+2$ passes through no lattice point with $0<x \le 100$ for all $m$ such that $\frac{1}{2}<m<a$. What is the maximum possible value of $a$? $ \textbf{(A)}\ \frac{51}{101} \qquad \textbf{(B)}\ \frac{50}{99} \qquad \textbf{(C)}\ \frac{51}{100} \qquad \textbf{(D)}\ \frac{52}{101} \qquad \textbf{(E)}\ \frac{13}{25} $

Let $\mathcal S$ be the sphere with center $(0,0,1)$ and radius $1$ in $\mathbb R^3$. A plane $\mathcal P$ is tangent to $\mathcal S$ at the point $(x_0,y_0,z_0)$, where $x_0$, $y_0$, and $z_0$ are all positive. Suppose the intersection of plane $\mathcal P$ with the $xy$-plane is the line with equation $2x+y=10$ in $xy$-space. What is $z_0$?

What is the area of the region defined by the inequality $ |3x\minus{}18|\plus{}|2y\plus{}7|\le 3$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \frac{7}{2} \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ \frac{9}{2} \qquad \textbf{(E)}\ 5$

Given a parabola $C: y^2=4px\ (p>0)$ with focus $F(p,\ 0)$. Let two lines $l_1,\ l_2$ passing through $F$ intersect orthogonaly each other, $C$ intersects with $l_1$ at two points $P_1,\ P_2$ and $C$ intersects with $l_2$ at two points $Q_1,\ Q_2$. Answer the following questions. (1) Set the equation of $l_1$ as $x=ay+p$ and let the coordinates of $P_1,\ P_2$ as $(x_1,\ y_1),\ (x_2,\ y_2)$, respectively. Express $y_1+y_2,\ y_1y_2$ in terms of $a,\ p$. (2) Show that $\frac{1}{P_1P_2}+\frac{1}{Q_1Q_2}$ is constant regardless of way of taking $l_1,\ l_2$.

Find polynomials $f(x)$, $g(x)$, and $h(x)$, if they exist, such that for all $x$, \[|f(x)|-|g(x)|+h(x)=\begin{cases}-1 & \text{if }x<-1\\3x+2 &\text{if }-1\leq x\leq 0\\-2x+2 & \text{if }x>0.\end{cases}\]

For the several values of the parameter $m\in \mathbb{N^{*}}$,find the pairs of integers $(a,b)$ that satisfy the relation $\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \frac{[a,m]+[b,m]}{(a+b)m}=\frac{10}{11}$, and,moreover,on the Cartesian plane $Oxy$ the lie in the square $D=\{(x,y):1\leq x\leq 36,1\leq y\leq 36\}$. [i][u]Note:[/u]$[k,l]$ denotes the least common multiple of the positive integers $k,l$.[/i]

$ABCD$ is a square of side 1. $P$ and $Q$ are points on $AB$ and $BC$ such that $\widehat{PDQ} = 45^{\circ}$. Find the perimeter of $\Delta PBQ$.

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

In polar coordinates, the equation $\rho=\frac{1}{1-\cos\theta+\sin\theta}$ stands for a $\text{(A)}$circle $\text{(B)}$ellipse $\text{(C)}$hyperbola $\text{(D)}$parabola

Alice and Bob play a game on a Cartesian Coordinate Plane. At the beginning, Alice chooses a lattice point $ \left(x_{0}, y_{0}\right) $ and places a pudding. Then they plays by turns (B goes first) according to the rules a. If $ A $ places a pudding on $ \left(x,y\right) $ in the last round, then $ B $ can only place a pudding on one of $ \left(x+2, y+1\right), \left(x+2, y-1\right), \left(x-2, y+1\right), \left(x-2, y-1\right) $ b. If $ B $ places a pudding on $ \left(x,y\right) $ in the last round, then $ A $ can only place a pudding on one of $ \left(x+1, y+2\right), \left(x+1, y-2\right), \left(x-1, y+2\right), \left(x-1, y-2\right) $ Furthermore, if there is already a pudding on $ \left(a,b\right) $, then no one can place a pudding on $ \left(c,d\right) $ where $ c \equiv a \pmod{n}, d \equiv b \pmod{n} $. 1. Who has a winning strategy when $ n = 2018 $ 1. Who has a winning strategy when $ n = 2019 $

Have $b, c \in R$ satisfy $b \in (0, 1)$ and $c > 0$, then let $A,B$ denote the points of intersection of the line $y = bx+c$ with $y = |x|$, and let $O$ denote the origin of $R^2$. Let $f(b, c)$ denote the area of triangle $\vartriangle OAB$. Let $k_0 = \frac{1}{2022}$ , and for $n \ge 1$ let $k_n = k^2_{n-1}$. If the sum $\sum^{\infty}_{n=1}f(k_n, k_{n-1})$ can be written as $\frac{p}{q}$ for relatively prime positive integers $p, q$, find the remainder when $p+q$ is divided by 1000.

Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ? [i]Proposed by Hungary.[/i] [hide="Remark"]I'm not sure I'm posting this in a right Forum.[/hide]

Show that if $ A$ is a shape in the Cartesian coordinate plane with area greater than $ 1$, then there are distinct points $(a, b)$, $(c, d)$ in $A$ where $a - c = 2x + 5y$ and $b - d = x + 3y$ where $x, y$ are integers.

[asy] import cse5; size(180); real a=4, b=3; pathpen=black; pair A=(a,0), B=(0,b), C=(0,0); D(MP("A",A)--MP("B",B,N)--MP("C",C,SW)--cycle); pair X=IP(B--A,(0,0)--(b,a)); D(CP((X+C)/2,C)); D(MP("R",IP(CP((X+C)/2,C),B--C),NW)--MP("Q",IP(CP((X+C)/2,C),A--C+(0.1,0)))); //Credit to chezbgone2 for the diagram[/asy] In $\triangle ABC$, $AB = 10~ AC = 8$ and $BC = 6$. Circle $P$ is the circle with smallest radius which passes through $C$ and is tangent to $AB$. Let $Q$ and $R$ be the points of intersection, distinct from $C$ , of circle $P$ with sides $AC$ and $BC$, respectively. The length of segment $QR$ is $\textbf{(A) }4.75\qquad\textbf{(B) }4.8\qquad\textbf{(C) }5\qquad\textbf{(D) }4\sqrt{2}\qquad \textbf{(E) }3\sqrt{3}$

On a cartesian plane a parabola $y = x^2$ is drawn. For a given $k > 0$ we consider all trapezoids inscribed into this parabola with bases parallel to the x-axis, and the product of the lengths of their bases is exactly $k$. Prove that the diagonals of all such trapezoids share a common point.

Triangle $ABC$ lies entirely in the first quadrant of the Cartesian plane, and its sides have slopes $63$, $73$, $97$. Suppose the curve $\mathcal V$ with equation $y=(x+3)(x^2+3)$ passes through the vertices of $ABC$. Find the sum of the slopes of the three tangents to $\mathcal V$ at each of $A$, $B$, $C$. [i]Proposed by Akshaj[/i]