Prove that the set of all the points with both coordinates begin rational numbers can be written as a reunion of two disjoint sets $ A$ and $ B$ such that any line that that is parallel with $ Ox$, and respectively $ Oy$ intersects $ A$, and respectively $ B$ in a finite number of points.

Let $\tau (n)$ denote the number of positive integer divisors of $n$. Find the sum of the six least positive integers $n$ that are solutions to $\tau (n) + \tau (n+1) = 7$.

Prove that among any nine divisors of $30^{2010}$ there are two whose product is a perfect square.

Let $l, m, n$ be positive integers and $p$ be prime. If $p^{2l-1}m(mn+1)^2 + m^2$ is a perfect square, prove that $m$ is also a perfect square.

Solve the equation \[ 3^x \minus{} 5^y \equal{} z^2.\] in positive integers. [i]Greece[/i]

For how many positive integers $n \le 1000$ is $$\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$$ not divisible by $3$? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) $\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$

[u]Round 5[/u] [i]Each of the three problems in this round depends on the answer to two of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. [/i] [b]p13.[/b] Let $B$ be the answer to problem $14$, and let $C$ be the answer to problem $15$. A quadratic function $f(x)$ has two real roots that sum to $2^{10} + 4$. After translating the graph of $f(x)$ left by $B$ units and down by $C$ units, the new quadratic function also has two real roots. Find the sum of the two real roots of the new quadratic function. [b]p14.[/b] Let $A$ be the answer to problem $13$, and let $C$ be the answer to problem $15$. In the interior of angle $\angle NOM = 45^o$, there is a point $P$ such that $\angle MOP = A^o$ and $OP = C$. Let $X$ and $Y$ be the reflections of $P$ over $MO$ and $NO$, respectively. Find $(XY)^2$. [b]p15.[/b] Let $A$ be the answer to problem $13$, and let $B$ be the answer to problem $14$. Totoro hides a guava at point $X$ in a flat field and a mango at point $Y$ different from $X$ such that the length $XY$ is $B$. He wants to hide a papaya at point $Z$ such that $Y Z$ has length $A$ and the distance $ZX$ is a nonnegative integer. In how many different locations can he hide the papaya? [u]Round 6[/u] [b]p16.[/b] Let $ABCD$ be a trapezoid such that $AB$ is parallel to $CD$, $AB = 4$, $CD = 8$, $BC = 5$, and $AD = 6$. Given that point $E$ is on segment $CD$ and that $AE$ is parallel to $BC$, find the ratio between the area of trapezoid $ABCD$ and the area of triangle $ABE$. [b]p17.[/b] Find the maximum possible value of the greatest common divisor of $\overline{MOO}$ and $\overline{MOOSE}$, given that $S$, $O$, $M$, and $E$ are some nonzero digits. (The digits $S$, $O$, $M$, and $E$ are not necessarily pairwise distinct.) [b]p18.[/b] Suppose that $125$ politicians sit around a conference table. Each politician either always tells the truth or always lies. (Statements of a liar are never completely true, but can be partially true.) Each politician now claims that the two people beside them are both liars. Suppose that the greatest possible number of liars is $M$ and that the least possible number of liars is $N$. Determine the ordered pair $(M,N)$. [u]Round 7[/u] [b]p19.[/b] Define a [i]lucky [/i] number as a number that only contains $4$s and $7$s in its decimal representation. Find the sum of all three-digit lucky numbers. [b]p20.[/b] Let line segment $AB$ have length $25$ and let points $C$ and $D$ lie on the same side of line $AB$ such that $AC = 15$, $AD = 24$, $BC = 20$, and $BD = 7$. Given that rays $AC$ and $BD$ intersect at point $E$, compute $EA + EB$. [b]p21.[/b] A $3\times 3$ grid is filled with positive integers and has the property that each integer divides both the integer directly above it and directly to the right of it. Given that the number in the top-right corner is $30$, how many distinct grids are possible? [u]Round 8[/u] [b]p22.[/b] Define a sequence of positive integers $s_1, s_2, ... , s_{10}$ to be [i]terrible [/i] if the following conditions are satisfied for any pair of positive integers $i$ and $j$ satisfying $1 \le i < j \le 10$: $\bullet$ $s_i > s_j $ $\bullet$ $j - i + 1$ divides the quantity $s_i + s_{i+1} + ... + s_j$ Determine the minimum possible value of $s_1 + s_2 + ...+ s_{10}$ over all terrible sequences. [b]p23.[/b] The four points $(x, y)$ that satisfy $x = y^2 - 37$ and $y = x^2 - 37$ form a convex quadrilateral in the coordinate plane. Given that the diagonals of this quadrilateral intersect at point $P$, find the coordinates of $P$ as an ordered pair. [b]p24.[/b] Consider a non-empty set of segments of length $1$ in the plane which do not intersect except at their endpoints. (In other words, if point $P$ lies on distinct segments $a$ and $b$, then $P$ is an endpoint of both $a$ and $b$.) This set is called $3$-[i]amazing [/i] if each endpoint of a segment is the endpoint of exactly three segments in the set. Find the smallest possible size of a $3$-amazing set of segments. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2934024p26255963]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer is called [i]nice[/i] if the sum of its digits in the number system with base $ 3$ is divisible by $ 3$. Calculate the sum of the first $ 2005$ nice positive integers.

Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?

For each positive integer $n$ let $p(n)$ be the number of ordered pairs $(x,y)$ of positive integers such that$$\dfrac{1}{x}+\dfrac{1}{y} =\dfrac{1}{n}.$$For example, for $n=2$ the pairs are $(3,6),(4,4),(6,3)$. Therefore $p(2)=3$. a) Determine $p(n)$ for all $n$ and calculate $p(1995)$. b) Determine all pairs $n$ such that $p(n)=3$.

[b]p1[/b]. Points $P_1,P_2,P_3,... ,P_n$ lie on a plane such that $P_aP_b = 1$,$P_cP_d = 2$, and $P_eP_f = 2018$ for not necessarily distinct indices $a,b,c,d,e, f \in \{1, 2,... ,n\}$. Find the minimum possible value of $n$. [b]p2.[/b] Find the coefficient of the $x^2y^4$ term in the expansion of $(3x +2y)^6$. [b]p3.[/b] Find the number of positive integers $n < 1000$ such that $n$ is a multiple of $27$ and the digit sum of $n$ is a multiple of $11$. [b]p4.[/b] How many times do the minute hand and hour hand of a $ 12$-hour analog clock overlap in a $366$-day leap year? [b]p5.[/b] Find the number of ordered triples of integers $(a,b,c)$ such that $(a +b)(b +c)(c + a) = 2018$. [b]p6.[/b] Let $S$ denote the set of the first $2018$ positive integers. Call the score of a subset the sum of its maximal element and its minimal element. Find the sum of score $(x)$ over all subsets $s \in S$ [b]p7.[/b] How many ordered pairs of integers $(a,b)$ exist such that $1 \le a,b \le 20$ and $a^a$ divides $b^b$? [b]p8.[/b] Let $f$ be a function such that for every non-negative integer $p$, $f (p)$ equals the number of ordered pairs of positive integers $(a,n)$ such that $a^n = a^p \cdot n$. Find $\sum^{2018}_{p=0}f (p)$. [b]p9.[/b] A point $P$ is randomly chosen inside a regular octagon $A_1A_2A_3A_4A_5A_6A_7A_8$. What is the probability that the projections of $P$ onto the lines $\overleftrightarrow{A_i A_{i+1}}$ for $i = 1,2,... ,8$ lie on the segments $\overline{A_iA_{i+1}}$ for $i = 1,2,... ,8$ (where indices are taken $mod \,\, 8$)? [b]p10. [/b]A person keeps flipping an unfair coin until it flips $3$ tails in a row. The probability of it landing on heads is $\frac23$ and the probability it lands on tails is $\frac13$ . What is the expected value of the number of the times the coin flips? PS. You had better use hide for answers.

Let $(x_{n})_{n=1}^{+\infty}$ be a sequence defined recursively with $x_{n+1} = x_{n}(x_{n}-2)$ and $x_{1} = \frac{7}{2}$. Let $x_{2021} = \frac{a}{b}$, where $a,b \in \mathbb{N}$ are coprime. Show that if $p$ is a prime divisor of $a$, then either $3|p-1$ or $p=3$. [i]Authored by Nikola Velov[/i]

Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.

Determine all triples $(x, y, z)$ of positive integers $x > y > z > 0$, such that $x^2 = y \cdot 2^z + 1$

Does there exist $ 2002$ distinct positive integers $ k_1, k_2, \cdots k_{2002}$ such that for any positive integer $ n \geq 2001$, one of $ k_12^n \plus{} 1, k_22^n \plus{} 1, \cdots, k_{2002}2^n \plus{} 1$ is prime?

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

$n\ge 2$ positive integers are written on the blackboard. A move consists of three steps: 1) choose an arbitrary number $a$ on the blackboard, 2) calculate the least common multiple $N$ of all numbers written on the blackboard, and 3) replace $a$ by $N/a$. Prove that using such moves it is always possible to make all the numbers on the blackboard equal to $1$. [i](A. Naradzetski)[/i]

Prove that there are infinitely many positive integers $k$ such that $k(k+1)(k+2)(k+3)$ has no prime divisor of the form $8t+5.$

Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$

Find all triplets of natural numbers $(a,b,c)$ that satisfy the equation $abc=a+b+c+1$.

Find all a positive integers $a$ and $b$, such that $$\frac{a^b+b^a}{a^a-b^b}$$ is an integer

Find all triples $(a,b,c)$ of non-negative integers satisfying $a\ge b\ge c$ and \[1\cdot a^3+9\cdot b^2+9\cdot c+7=1997 \]

Let $n$ and $m$ be natural numbers such that $m+ i=a_ib_i^2$ for $i=1,2, \cdots n$ where $a_i$ and $b_i$ are natural numbers and $a_i$ is not divisible by a square of a prime number. Find all $n$ for which there exists an $m$ such that $\sum_{i=1}^{n}a_i=12$

Let $d > 0$ be an arbitrary real number. Consider the set $S_{n}(d)=\{s=\frac{1}{x_{1}}+\frac{1}{x_{2}}+...+\frac{1}{x_{n}}|x_{i}\in\mathbb{N},s<d\}$. Prove that $S_{n}(d)$ has a maximum element.

Find all $10$ digit numbers $a_0a_1...a_9$ such that for each $k, a_k$ is the number of times that the digit $k$ appears in the number.