Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.

For some integer $n > 0$, a square paper of side length $2^{n}$ is repeatedly folded in half, right-to-left then bottom-to-top, until a square of side length 1 is formed. A hole is then drilled into the square at a point $\tfrac{3}{16}$ from the top and left edges, and then the paper is completely unfolded. The holes in the unfolded paper form a rectangular array of unevenly spaced points; when connected with horizontal and vertical line segments, these points form a grid of squares and rectangles. Let $P$ be a point chosen randomly from \textit{inside} this grid. Suppose the largest $L$ such that, for all $n$, the probability that the four segments $P$ is bounded by form a square is at least $L$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers. Find $m+n$.

Function $f(x)=-\frac{1}{2}x^2+\frac{13}{2}$. If the minumum and maximum value of $f(x)$ are $2a$ and $2b$ respectively on $[a,b]$. Find $a,b$.

Find all $ x,y,z\in\mathbb{N}_{0}$ such that $ 7^{x} \plus{} 1 \equal{} 3^{y} \plus{} 5^{z}$. [i]Alternative formulation:[/i] Solve the equation $ 1\plus{}7^{x}\equal{}3^{y}\plus{}5^{z}$ in nonnegative integers $ x$, $ y$, $ z$.

A positive integer $n$ is abundant if the sum of its proper divisors exceeds $n$. Show that every integer greater than $89 \times 315$ is the sum of two abundant numbers.

The faces of each of $7$ standard dice are labeled with the integers from $1$ to $6$. Let $p$ be the probability that when all $7$ dice are rolled, the sum of the numbers on the top faces is $10$. What other sum occurs with the same probability as $p$? $\textbf{(A)} \text{ 13} \qquad \textbf{(B)} \text{ 26} \qquad \textbf{(C)} \text{ 32} \qquad \textbf{(D)} \text{ 39} \qquad \textbf{(E)} \text{ 42}$

Given that $a$ and $b$ are real numbers such that for infinitely many positive integers $m$ and $n$, \[ \lfloor an + b \rfloor \ge \lfloor a + bn \rfloor \] \[ \lfloor a + bm \rfloor \ge \lfloor am + b \rfloor \] Prove that $a = b$.

Let $S$ be the set of all positive integers $n$ such that the sum of all factors of $n$, including $1$ and $n$, is $120$. Compute the sum of all numbers in $S$. [i]Proposed by Evin Liang[/i]

Define real number $y$ as the fractional part of real number $x$ such that $0\leq y<1$ and $x-y$ is integer. Denote this by $<x>$. For real number $a$, define an infinite sequence $\{a_n\}\ (n=1,\ 2,\ 3,\ \cdots)$ inductively as follows. (i) $a_1=<a>$ (ii) If $a\n\neq 0$, then $a_{n+1}=\left<\frac{1}{a_n}\right>$, if $a_n=0$, then $a_{n+1}=0$. (1) For $a=\sqrt{2}$, find $a_n$. (2) For any natural number $n$, find real number $a\geq \frac 13$ such that $a_n=a$. (3) Let $a$ be a rational number. When we express $a=\frac{p}{q}$ with integer $p$, natural number $q$, prove that $a_n=0$ for any natural number $n\geq q$. [i]2011 Tokyo University entrance exam/Science, Problem 2[/i]

Let $ABC$ be a triangle with $AB = 6$, $AC = 8$, $BC = 7$. Let $H$ be the orthocenter of $ABC$. Let $D \ne H$ be a point on $\overline{AH}$ such that $\angle HBD =\frac32 \angle CAB+ \frac12 \angle ABC - \frac12 \angle BCA$. Find $DH$.

Let $\triangle ABC$ be an equilateral triangle of side length 1. Let $D,E,F$ be points on $BC,AC,AB$ respectively, such that $\frac{DE}{20} = \frac{EF}{22} = \frac{FD}{38}$. Let $X,Y,Z$ be on lines $BC,CA,AB$ respectively, such that $XY\perp DE, YZ\perp EF, ZX\perp FD$. Find all possible values of $\frac{1}{[DEF]} + \frac{1}{[XYZ]}$.

2018 little ducklings numbered 1 through 2018 are standing in a line, with each holding a slip of paper with a nonnegative number on it; it is given that ducklings 1 and 2018 have the number zero. At some point, ducklings 2 through 2017 change their number to equal the average of the numbers of the ducklings to their left and right. Suppose the new numbers on the ducklings sum to 1000. What is the maximum possible sum of the original numbers on all 2018 slips?

Let $X$ be a regular topological space and let $S$ be a countably compact dense subspace in $X$. (The countably compact property means that every infinite subset of $S$ has an accumulation point in $S$.) Show that $S$ is also $G_\delta$-dense in $X$, i.e., $S$ intersects all nonempty $G_\delta$ sets.

Suppose that $n \ge 2$. Prove that \[\sum_{k=2}^{n}\left\lfloor \frac{n^{2}}{k}\right\rfloor = \sum_{k=n+1}^{n^{2}}\left\lfloor \frac{n^{2}}{k}\right\rfloor.\]

Given a real number $p>1$, a continuous function $h\colon [0,\infty)\to [0,\infty)$, and a smooth vector field $Y\colon \mathbb{R}^n \to \mathbb{R}^n$ with $\mathrm{div}~Y=0$, prove the following inequality \[\int_{\mathbb{R}^n}h(|x|)|x|^{p}\leq \int_{\mathbb{R}^{n}}h(|x|)|x+Y(x)|^{p}.\]

Use a compass and a ruler to construct a triangle, given the intersection point of its median, the orthocenter, and one from the vertices.

Find all functions $f:\mathbb{Q}\rightarrow\mathbb{R}$ such that \[ f(x)^2-f(y)^2=f(x+y)\cdot f(x-y), \] for all $x,y\in \mathbb{Q}$. [i]Proposed by Portugal.[/i]

Jeffrey rolls fair three six-sided dice and records their results. The probability that the mean of these three numbers is greater than the median of these three numbers can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

Let $\ell$ be a straight line and $P \notin \ell$ be a point in the plane. On $\ell$ are, in this arrangement, points $A_1, A_2,...$ such that the radii of the incircles of all triangles $P A_iA_{i + 1}$ are equal. Let $k \in N$. Show that the radius of the incircle of the triangle $P A_j A_{j + k}$ does not depend on the choice of $j \in N$ .

For a permutation $\pi$ of the integers from 1 to 10, define \[ S(\pi) = \sum_{i=1}^{9} (\pi(i) - \pi(i+1))\cdot (4 + \pi(i) + \pi(i+1)), \] where $\pi (i)$ denotes the $i$th element of the permutation. Suppose that $M$ is the maximum possible value of $S(\pi)$ over all permutations $\pi$ of the integers from 1 to 10. Determine the number of permutations $\pi$ for which $S(\pi) = M$. [i]Ray Li[/i]

Find all Riemann integrable functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ which have the property that, for all nonconstant and continuous functions $ g:\mathbb{R}\longrightarrow\mathbb{R}, $ and all real numbers $ a,b $ such that $ a<b, $ the following equality holds. $$ \int_a^b \left( f\circ g \right) (x)dx=\int_a^b \left( g\circ f \right) (x)dx $$ [i]Cosmin Nițu[/i]

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ which are relatively prime to $n$. Compute $\displaystyle \sum_{i=1}^{\phi(2023)} \dfrac{\gcd(i,\phi(2023))}{\phi(2023)}$. [i]Proposed by Giacomo Rizzo[/i]

Find the functions $f: \mathbb{R} \to (0, \infty)$ which satisfy $$2^{-x-y} \le \frac{f(x)f(y)}{(x^2+1)(y^2+1)} \le \frac{f(x+y)}{(x+y)^2+1},$$ for all $x,y \in \mathbb{R}.$

We are given a trapezoid $ABCD$ with $AB \parallel CD$, $CD=2AB$ and $DB \perp BC$. Let $E$ be the intersection of lines $DA$ and $CB$, and $M$ be the midpoint of $DC$. (a) Prove that $ABMD$ is a rhombus. (b) Prove that triangle $CDE$ is isosceles. (c) If $AM$ and $BD$ meet at $O$, and $OE$ and $AB$ meet at $N,$ prove that the line $DN$ bisects segment $EB$.

Let $r$ and $k$ be positive integers such that all prime divisors of $r$ are greater than $50$. A positive integer, whose decimal representation (without leading zeroes) has at least $k$ digits, will be called [i]nice[/i] if every sequence of $k$ consecutive digits of this decimal representation forms a number (possibly with leading zeroes) which is a multiple of $r$. Prove that if there exist infinitely many nice numbers, then the number $10^k-1$ is nice as well.