Find a four-digit number such that the remainders after its division by $131$ and $132$ are $112$ and $98$, respectively.

Let $x_k=\frac{k(k+1)}{2}$ for all integers $k\ge 1$. Prove that for any integer $n \ge 10$, between the numbers $A=x_1+x_2 + \ldots + x_{n-1}$ and $B=A+x_n$ there is at least one square.

Prove that for every natural number $k$, at least one of the integers \[ 2k-1, \quad 5k-1 \quad \text{and} \quad 13k-1\] is not a perfect square.

Let $a,b$ be two integers such that their gcd has at least two prime factors. Let $S = \{ x \mid x \in \mathbb{N}, x \equiv a \pmod b \} $ and call $ y \in S$ irreducible if it cannot be expressed as product of two or more elements of $S$ (not necessarily distinct). Show there exists $t$ such that any element of $S$ can be expressed as product of at most $t$ irreducible elements.

Mr. Squash bought a large parking lot in Utah, which has an area of $600$ square meters. A car needs $6$ square meters of parking space while a bus needs $30$ square meters of parking space. Mr. Squash charges $\$2.50$ per car and $\$7.50$ per bus, but Mr. Squash can only handle at most $60$ vehicles at a time. Find the ordered pair $(a,b)$ where $a$ is the number of cars and $b$ is the number of buses that maximizes the amount of money Mr. Squash makes. [i]Proposed by Nathan Cho[/i]

The positive difference between a pair of primes is equal to $2$, and the positive difference between the cubes of the two primes is $31106$. What is the sum of the digits of the least prime that is greater than those two primes? $\textbf{(A) } 8 \qquad \textbf{(B) } 10 \qquad \textbf{(C) } 11 \qquad \textbf{(D) } 13 \qquad \textbf{(E) } 16$

Several boys and girls are dancing a waltz at a ball. Is it possible that each girl can always get to dance the next dance with either a more handsome or more clever boy than for the previous dance, and that each time at least $80\%$ of the girls get to dance the next dance with a boy who is more handsome and more clever? (The numbers of boys and girls are equal and all are dancing.) (AY Belov)

How many positive integers are there such that $\frac{2n^2+4n+18}{3n+3}$ is an integer?

Given that the answer to this problem can be expressed as $a\cdot b\cdot c$, where $a$, $b$, and $c$ are pairwise relatively prime positive integers with $b=10$, compute $1000a+100b+10c$. [i]Proposed by Ankit Bisain[/i]

(a) Find the value of the real number $k$, for which the polynomial $P(x)=x^3-kx+2$ has the number $2$ as a root. In addition, for the value of $k$ you will find, write this polynomial as the product of two polynomials with integer coefficients. (b) If the positive real numbers $a,b$ satisfy the equation $$2a+b+\frac{4}{ab}=10,$$ find the maximum possible value of $a$.

For a positive integer $n$ denote $r(n)$ the number having the digits of $n$ in reverse order- for example, $r(2006) = 6002$. Prove that for any positive integers a and b the numbers $4a^2 + r(b)$ and $4b^2 + r(a)$ can not be simultaneously squares.

Find all pairs $ (m, n)$ of positive integers that have the following property: For every polynomial $P (x)$ of real coefficients and degree $m$, there exists a polynomial $Q (x)$ of real coefficients and degree $n$ such that $Q (P (x))$ is divisible by $Q (x)$.

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 $