For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.

Find at least one real number $A{}$ such that for any positive integer $n{}$ the distance between $\lceil A^n\rceil$ and the nearest square of an integer is equal to two. [i]Dmitry Krekov[/i]

Find the least possible value for the fraction $$\frac{lcm(a,b)+lcm(b,c)+lcm(c,a)}{gcd(a,b)+gcd(b,c)+gcd(c,a)}$$ over all distinct positive integers $a, b, c$. By $lcm(x, y)$ we mean the least common multiple of $x, y$ and by $gcd(x, y)$ we mean the greatest common divisor of $x, y$.

[b]p13.[/b] Suppose $\overline{AB}$ is a radius of a circle. If a point $C$ is chosen uniformly at random inside the circle, what is the probability that triangle $ABC$ has an obtuse angle? [b]p14.[/b] Find the second smallest positive integer $c$ such that there exist positive integers $a$ and $b$ satisfying the following conditions: $\bullet$ $5a = b = \frac{c}{5} + 6$. $\bullet$ $a + b + c$ is a perfect square. [b]p15.[/b] A spotted lanternfly is at point $(0, 0, 0)$, and it wants to land on an unassuming CMU student at point $(2, 3, 4)$. It can move one unit at a time in either the $+x$, $+y$, or $+z$ directions. However, there is another student waiting at $(1, 2, 3)$ who will stomp on the lanternfly if it passes through that point. How many paths can the lanternfly take to reach its target without getting stomped? PS. You should use hide for answers.

Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations: $$\log_2\left({x \over yz}\right) = {1 \over 2}$$ $$\log_2\left({y \over xz}\right) = {1 \over 3}$$ $$\log_2\left({z \over xy}\right) = {1 \over 4}$$ Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is ${m \over n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Albert has a very large bag of candies and he wants to share all of it with his friends. At first, he splits the candies evenly amongst his $20$ friends and himself and he finds that there are five left over. Ante arrives, and they redistribute the candies evenly again. This time, there are three left over. If the bag contains over $500$ candies, what is the fewest number of candies the bag can contain?

Let $r,s,t$ positive integers which are relatively prime and $a,b \in G$, $G$ a commutative multiplicative group with unit element $e$, and $a^r=b^s=(ab)^t=e$. (a) Prove that $a=b=e$. (b) Does the same hold for a non-commutative group $G$?

Consider any three consecutive natural numbers. Prove that the cube of the largest cannot be the sum of the cubes of the other two.

Prove that for no natural $m$ a number $m(m+1)$ is a power of an integer.

For every integer $m>1$, let $p(m)$ be the least prime divisor of $m$. If $a$ and $b$ are integers greater than $1$ such that: $$a^2+b=p(a)+[p(b)]^2$$ Show that $a=b$

Each cell of a $3\times n$ table was filled by a number. In each of three rows, the number $1,2,…,n$ appear in some order. It is know that for each column, the sum of pairwise product of three numbers in it is a multiple of $n$. Find all possible value of $n$.

For the positive integer $n$, define $f(n)=\min\limits_{m\in\Bbb Z}\left|\sqrt2-\frac mn\right|$. Let $\{n_i\}$ be a strictly increasing sequence of positive integers. $C$ is a constant such that $f(n_i)<\dfrac C{n_i^2}$ for all $i\in\{1,2,\ldots\}$. Show that there exists a real number $q>1$ such that $n_i\geqslant q^{i-1}$ for all $i\in\{1,2,\ldots \}$.

A positive integer $n$ is called $nice$, if the sum of the squares of all its positive divisors is equal to $(n+3)^2$. Prove that if $n=pq$ is nice, where $p, q$ are not necessarily distinct primes, then $n+2$ and $2(n+1)$ are simultaneously perfect squares.

[u]Round 1[/u] [b]p1.[/b] Alex is writing a sequence of $A$’s and $B$’s on a chalkboard. Any $20$ consecutive letters must have an equal number of $A$’s and $B$’s, but any 22 consecutive letters must have a different number of $A$’s and $B$’s. What is the length of the longest sequence Alex can write?. [b]p2.[/b] A positive number is placed on each of the $10$ circles in this picture. It turns out that for each of the nine little equilateral triangles, the number on one of its corners is the sum of the numbers on the other two corners. Is it possible that all $10$ numbers are different? [img]https://cdn.artofproblemsolving.com/attachments/b/f/c501362211d1c2a577e718d2b1ed1f1eb77af1.png[/img] [b]p3.[/b] Pablo and Nina take turns entering integers into the cells of a $3 \times 3$ table. Pablo goes first. The person who fills the last empty cell in a row must make the numbers in that row add to $0$. Can Nina ensure at least two of the columns have a negative sum, no matter what Pablo does? [b]p4. [/b]All possible simplified fractions greater than $0$ and less than $1$ with denominators less than or equal to $100$ are written in a row with a space before each number (including the first). Zeke and Qing play a game, taking turns choosing a blank space and writing a “$+$” or “$-$” sign in it. Zeke goes first. After all the spaces have been filled, Zeke wins if the value of the resulting expression is an integer. Can Zeke win no matter what Qing does? [img]https://cdn.artofproblemsolving.com/attachments/3/6/15484835686fbc2aa092e8afc6f11cd1d1fb88.png[/img] [b]p5.[/b] A police officer patrols a town whose map is shown. The officer must walk down every street segment at least once and return to the starting point, only changing direction at intersections and corners. It takes the officer one minute to walk each segment. What is the fastest the officer can complete a patrol? [img]https://cdn.artofproblemsolving.com/attachments/0/c/d827cf26c8eaabfd5b0deb92612a6e6ebffb47.png[/img] [u]Round 2[/u] [b]p6.[/b] Prove that among any $3^{2022}$ integers, it is possible to find exactly $3^{2021}$ of them whose sum is divisible by $3^{2021}$. [b]p7.[/b] Given a list of three numbers, a zap consists of picking two of the numbers and decreasing each of them by their average. For example, if the list is $(5, 7, 10)$ and you zap $5$ and $10$, whose average is $7.5$, the new list is $(-2.5, 7, 2.5)$. Is it possible to start with the list $(3, 1, 4)$ and, through some sequence of zaps, end with a list in which the sum of the three numbers is $0$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For every positive integer $ n$, let $ \phi(n)$ denotes the number of positive integers less than $ n$ that is relatively prime to $ n$ and $ \tau(n)$ denote the sum of all positive divisors of $ n$. Let $ n$ be a positive integer such that $ \phi(n)|n\minus{}1$ and that $ n$ is not a prime number. Prove that $ \tau(n)>2009$.

Have you ever found it strange that “almost the same” numbers can look very different? For example, in the decimal system $29$ and $30$ only differ by one unit but do not contain any common digits. The ALPHABETA numbering system uses only the digits$ 0$ and $1$ and avoids this situation: [img]https://cdn.artofproblemsolving.com/attachments/d/f/dcdf284b3baeea8775de56ece091c80d3449a8.png[/img] In it, the rule for constructing the successor of a number is as follows: without repeating a previous number in the list, change the digit as far to the right as possible, otherwise a 1 is placed to the left. (a) What number in the decimal system is represented in the ALPHABETA code by the number $111111$? (b) What is the next number in this code? (c) Describe an algorithm to find, given any number in the ALPHABETA code, the next number in this code.

Let $s(n)$ denote the smallest prime divisor and $d(n)$ denote the number of positive divisors of a positive integer $n>1$. Is it possible to choose $2023$ positive integers $a_{1},a_{2},...,a_{2023}$ with $a_{1}<a_{2}-1<...<a_{2023}-2022$ such that for all $k=1,...,2022$ we have $d(a_{k+1}-a_{k}-1)>2023^{k}$ and $s(a_{k+1}-a_{k}) > 2023^{k}$? [i]Authored by Nikola Velov[/i]

All natural numbers from $1$ to $N$, $ N \ge 2$ are written out in a certain order in a circle. Moreover, for any pair of neighboring numbers there is at least one digit appearing in the decimal notation of each of them. Find the smallest possible value of $N$.

Prove that there are infinitely many ordered pairs of positive integers $(m, n)$ such that $\frac{m+1}{n}+\frac{n+1}{m}$ is a positive integer.

Call a tuple $(b_m, b_{m+1},..., b_n)$ of integers perfect if both following conditions are fulfilled: 1. There exists an integer $a > 1$ such that $b_k = a^k + 1$ for all $k = m, m + 1,..., n$ 2. For all $k = m, m + 1,..., n,$ there exists a prime number $q$ and a non-negative integer $t$ such that $b_k = q^t$. Prove that if $n - m$ is large enough then there is no perfect tuples, and find all perfect tuples with the maximal number of components.

Does there exist a ten-digit number such that all its digits are different and after removing any six digits we get a composite four-digit number?

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

How many different numbers with $6$ digits and multiples of $45$ can be written by adding one digit to the left and one to the right of $2008$?

Given a polynomial $P(x)=a_{d}x^{d}+ \ldots +a_{2}x^{2}+a_{0}$ with positive integers for coefficients and degree $d\geq 2$. Consider the sequence defined by $$b_{1}=a_{0} ,b_{n+1}=P(b_{n}) $$ for $n \geq 1$ . Prove that for all $n \geq 2$ there exists a prime $p$ such that $p$ divides $b_{n}$ but does not divide $b_{1}b_{2} \ldots b_{n-1}$.

Find the minimum positive integer such that some four of its natural divisors sum up to $2025$.