Let $x$ and $y$ be integers. Prove that one of the expressions $$2x+3y \text{ and } 9x+5y$$ is divisible by $17$ if and only if so is the other.

Let $a, b, x,$ and $y$ be real numbers with $a>4$ and $b>1$ such that $$\frac{x^2}{a^2}+\frac{y^2}{a^2-16}=\frac{(x-20)^2}{b^2-1}+\frac{(y-11)^2}{b^2}=1.$$ Find the least possible value of $a+b.$

Let $ u$ be an odd number. Prove that $ \frac{3^{3u}\minus{}1}{3^u\minus{}1}$ can be written as sum of two squares.

Eighteen students participate in a team selection test with three problems, each worth up to seven points. All scores are nonnegative integers. After the competition, the results are posted by Evan in a table with 3 columns: the student's name, score, and rank (allowing ties), respectively. Here, a student's rank is one greater than the number of students with strictly higher scores (for example, if seven students score $0, 0, 7, 8, 8, 14, 21$ then their ranks would be $6, 6, 5, 3, 3, 2, 1$ respectively). When Richard comes by to read the results, he accidentally reads the rank column as the score column and vice versa. Coincidentally, the results still made sense! If the scores of the students were $x_1 \le x_2 \le \dots \le x_{18}$, determine the number of possible values of the $18$-tuple $(x_1, x_2, \dots, x_{18})$. In other words, determine the number of possible multisets (sets with repetition) of scores. [i]Proposed by Yang Liu[/i]

Determine what day of the week day was: June $6$, $1944$. Note: Leap years are those that are multiples of $4$ and do not end in $00$ or that are multiples of $400$, for example $1812$, $1816$, $1820$, $1600$, $2000$, but $1800$, $1810$, $2100$ are not leaps. Giving the answer without any mathematical justification will not award points.

The positive integers $1, 2, \ldots, 1000$ are written in some order on one line. Show that we can find a block of consecutive numbers, whose sum is in the interval $(100000; 100500]$.

A triangle has side lengths $a, b, c$. Prove that $$a(b -c)^2 + b(c - a)^2 + c(a - b)^2 + 4abc > a^3 + b^3 + c^3$$

The equation $ \sqrt {x \plus{} 10} \minus{} \frac {6}{\sqrt {x \plus{} 10}} \equal{} 5$ has: $ \textbf{(A)}\ \text{an extraneous root between } \minus{} 5\text{ and } \minus{} 1 \\ \textbf{(B)}\ \text{an extraneous root between } \minus{} 10\text{ and } \minus{} 6 \\ \textbf{(C)}\ \text{a true root between }20\text{ and }25 \qquad\textbf{(D)}\ \text{two true roots} \\ \textbf{(E)}\ \text{two extraneous roots}$

(1) Show the following inequality for every natural number $ k$. \[ \frac {1}{2(k \plus{} 1)} < \int_0^1 \frac {1 \minus{} x}{k \plus{} x}dx < \frac {1}{2k}\] (2) Show the following inequality for every natural number $ m,\ n$ such that $ m > n$. \[ \frac {m \minus{} n}{2(m \plus{} 1)(n \plus{} 1)} < \log \frac {m}{n} \minus{} \sum_{k \equal{} n \plus{} 1}^{m} \frac {1}{k} < \frac {m \minus{} n}{2mn}\]

There are 94 safes and 94 keys. Each key can open only one safe, and each safe can be opened by only one key. We place randomly one key into each safe. 92 safes are then randomly chosen, and then locked. What is the probability that we can open all the safes with the two keys in the two remaining safes? (Once a safe is opened, the key inside the safe can be used to open another safe.)

Find all real $x$ such that $ \sqrt{x - \frac{1}{x}} + \sqrt{1 - \frac{1}{x}}> \frac{x - 1}{x}$

Let $p_{n}$ again denote the $n$th prime number. Show that the infinite series \[\sum^{\infty}_{n=1}\frac{1}{p_{n}}\] diverges.

Let $ABC$ be an acute-angled triangle, and let $AA_1, BB_1, CC_1$ be its altitudes. Points $A', B', C'$ are chosen on the segments $AA_1, BB_1, CC_1$, respectively, so that $\angle BA'C = \angle AC'B = \angle CB'A = 90^{o}$. Let segments $AC'$ and $CA'$ intersect at $B"$; points $A", C"$ are defined similarly. Prove that hexagon $A'B"C'A"B'C"$ is circumscribed.

[list=a] [*]Is it possible to split a square into 4 isosceles triangles such that no two are congruent? [*]Is it possible to split an equilateral triangle into 4 isosceles triangles such that no two are congruent? [/list] [i]Vladimir Rastorguev[/i]

When all vertex angles of a convex polygon are equal, call it equiangular. Prove that $ p > 2$ is a prime number, if and only if the lengths of all sides of equiangular $ p$ polygon are rational numbers, it is a regular $ p$ polygon.

Given a real number $\alpha$ in whose decimal representation $\alpha=0,a_1a_2a_3\dots$ each decimal digit $a_i$ $(i=1,2,3,\dots)$ is a prime number. The decimal digits are arranged along the path indicated by arrows in the accompanying figure, which can be thought of as continuing infinitely to the right and downward. For each $m\geq 1$, the decimal representation of a real number $z_m$ is formed by writing before the decimal point the digit 0 and after the decimal point the sequence of digits of the $m$-th row from the top read from left to right from the adjacent arrangement. In an analogous way, for all $n\geq 1$, the real numbers $s_n$ are formed with the digits of the $n$-th column from the left to be read from top to bottom. For example, $z_3=0,a_5a_6a_7a_{12}a_{23}a_{28}\dots$ and $s_2=0,a_2a_3a_6a_{15}a_{18}a_{35}\dots$. Show: (a) If $\alpha$ is rational, then all $z_m$ and all $s_n$ are rational. (b) The converse of the statement formulated in (a) is false.

Let $n$ be any positive integer and $M$ a set that contains $n$ positive integers. A sequence with $2^n$ elements is christmassy if every element of the sequence is an element of $M$. Prove that, in any christmassy sequence there exist some successive elements, the product of whom is a perfect square.

[b]p1. [/b] If $f(x) = 3x - 1$, what is $f^6(2) = (f \circ f \circ f \circ f \circ f \circ f)(2)$? [b]p2.[/b] A frog starts at the origin of the $(x, y)$ plane and wants to go to $(6, 6)$. It can either jump to the right one unit or jump up one unit. How many ways are there for the frog to jump from the origin to $(6, 6)$ without passing through point $(2, 3)$? [b]p3.[/b] Alfred, Bob, and Carl plan to meet at a café between noon and $2$ pm. Alfred and Bob will arrive at a random time between noon and $2$ pm. They will wait for $20$ minutes or until $2$ pm for all $3$ people to show up after which they will leave. Carl will arrive at the café at noon and leave at $1:30$ pm. What is the probability that all three will meet together? [b]p4.[/b] Let triangle $ABC$ be isosceles with $AB = AC$. Let $BD$ be the altitude from $ B$ to $AC$, $E$ be the midpoint of $AB$, and $AF$ be the altitude from $ A$ to $BC$. If $AF = 8$ and the area of triangle $ACE$ is $ 8$, find the length of $CD$. [b]p5.[/b] Find the sum of the unique prime factors of $(2018^2 - 121) \cdot (2018^2 - 9)$. [b]p6.[/b] Compute the remainder when $3^{102} + 3^{101} + ... + 3^0$ is divided by $101$. [b]p7.[/b] Take regular heptagon $DUKMATH$ with side length $ 3$. Find the value of $$\frac{1}{DK}+\frac{1}{DM}.$$ [b]p8.[/b] RJ’s favorite number is a positive integer less than $1000$. It has final digit of $3$ when written in base $5$ and final digit $4$ when written in base $6$. How many guesses do you need to be certain that you can guess RJ’s favorite number? [b]p9.[/b] Let $f(a, b) = \frac{a^2+b^2}{ab-1}$ , where $a$ and $b$ are positive integers, $ab \ne 1$. Let $x$ be the maximum positive integer value of $f$, and let $y$ be the minimum positive integer value of f. What is $x - y$ ? [b]p10.[/b] Haoyang has a circular cylinder container with height $50$ and radius $5$ that contains $5$ tennis balls, each with outer-radius $5$ and thickness $1$. Since Haoyang is very smart, he figures out that he can fit in more balls if he cuts each of the balls in half, then puts them in the container, so he is ”stacking” the halves. How many balls would he have to cut up to fill up the container? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\Bbb{Z}^+$ denote the set of positive integers. Find all functions $f:\Bbb{Z}^+\to \Bbb{Z}^+$ that satisfy the following condition: for each positive integer $n,$ there exists a positive integer $k$ such that $$\sum_{i=1}^k f_i(n)=kn,$$ where $f_1(n)=f(n)$ and $f_{i+1}(n)=f(f_i(n)),$ for $i\geq 1. $

Let $a,b,c,d$ be positive reals such taht $a+b+c+d=1$. Prove that: \[6(a^{3}+b^{3}+c^{3}+d^{3})\geq a^{2}+b^{2}+c^{2}+d^{2}+\frac{1}{8}.\]

Show that there exists a sequence of positive integers $x_1, x_2,…x_n,…$ that satisfies the following two conditions: (i) Every positive integer appears exactly once, (ii) For every $n=1,2,…$ the partial sum $x_1+x_2+…+x_n$ is divisible by $n^n$.

Let $p$ be a prime number. A rational number $x$, with $0 < x < 1$, is written in lowest terms. The rational number obtained from $x$ by adding $p$ to both the numerator and the denominator differs from $x$ by $1/p^2$. Determine all rational numbers $x$ with this property.

Al and Bill play a game involving a fair six-sided die. The die is rolled until either there is a number less than $5$ rolled on consecutive tosses, or there is a number greater than $4$ on consecutive tosses. Al wins if the last roll is a $5$ or $6$. Bill wins if the last roll is a $2$ or lower. Let $m$ and $n$ be relatively prime positive integers such that $m/n$ is the probability that Bill wins. Find the value of $m+n$.

a) In $XYZ$ triangle, the incircle touches $XY$ and $XZ$ in $T$ and $W$, respectively. Prove that: $$XT=XW=\frac{XY+XZ-YZ}2$$ Let $ABC$ a triangle and $D$ the foot of the perpendicular of $A$ in $BC$. Let $I$, $J$ be the incenters of $ABD$ and $ACD$, respectively. The incircles of $ABD$ and $ACD$ touch $AD$ in $M$ and $N$, respectively. Let $P$ be where the incircle of $ABC$ touches $AB$. The circle with centre $A$ and radius $AP$ intersects $AD$ in $K$. b) Show that $\triangle IMK \cong \triangle KNJ$. c) Show that $IDJK$ is cyclic.

Alice and Bob are playing a game, starting with a binary string$ b$ of length $2022$. In each step, the rightmost digit of the string is deleted. If the deleted digit was $1$, Alice gets to choose which digit she wants to append on the left. Otherwise, Bob gets to choose the digit to append on the left of the string. Alice would like to turn the string $b$ into the all-zero string $\underbrace{00 . . . 0}_{2022}$, in the least number of steps possible, while Bob would like to maximize the number of steps necessary, or prevent Alice from doing this at all. a) Is there a string $b$ for which Bob can prevent Alice in her goal, if both players play optimally? b) If the answer to part a is yes, find all such strings $b$. If the answer is no, find the maximal game time and find the set of strings $b$ for which the game time is maximal.