What is the last two digits of the number $(11 + 12 + 13 + ... + 2006)^2$?

Let $a$ and $b$ be positive integers satisfying \[ \frac a{a-2} = \frac{b+2021}{b+2008} \] Find the maximum value $\dfrac ab$ can attain.

Determine all positive integers $n$ with the property that $n = (d(n))^2$. Here $d(n)$ denotes the number of positive divisors of $n$.

The first digit of a $6$-digit number is $5$. Is it true that it is always possible to write $6$ more digits to the right of this number so that the resulting $12$-digit number is a perfect square? (A Tolpygo)

Let $a_n$ be a sequence given by $a_1 = 18$, and $a_n = a_{n-1}^2+6a_{n-1}$, for $n>1$. Prove that this sequence contains no perfect powers.

Do there exist two positive powers of $5$ such that the number obtained by writing one after the other is also a power of $5$?

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $a_1,b_1,c_1$ be natural numbers. We define \[a_2=\gcd(b_1,c_1),\,\,\,\,\,\,\,\,b_2=\gcd(c_1,a_1),\,\,\,\,\,\,\,\,c_2=\gcd(a_1,b_1),\] and \[a_3=\operatorname{lcm}(b_2,c_2),\,\,\,\,\,\,\,\,b_3=\operatorname{lcm}(c_2,a_2),\,\,\,\,\,\,\,\,c_3=\operatorname{lcm}(a_2,b_2).\] Show that $\gcd(b_3,c_3)=a_2$.

[b]p1.[/b] The coins in Merryland all have different integer values: there is a single $1$ cent coin, a single $2$ cent coin, etc. What is the largest number of coins that a resident of Merryland can have if we know that their total value does not exceed $2021$ cents? [b]p2.[/b] For every positive integer $k$ let $$a_k = \left(\sqrt{\frac{k + 1}{k}}+\frac{\sqrt{k+1}}{k}-\frac{1}{k}-\sqrt{\frac{1}{k}}\right).$$ Evaluate the product $a_4a_5...a_{99}$. Your answer must be as simple as possible. [b]p3.[/b] Prove that for every positive integer $n$ there is a permutation $a_1, a_2, . . . , a_n$ of $1, 2, . . . , n$ for which $j + a_j$ is a power of $2$ for every $j = 1, 2, . . . , n$. [b]p4.[/b] Each point of the $3$-dimensional space is colored one of five different colors: blue, green, orange, red, or yellow, and all five colors are used at least once. Show that there exists a plane somewhere in space which contains four points, no two of which have the same color. [b]p5.[/b] Suppose $a_1 < b_1 < a_2 < b_2 <... < a_n < b_n$ are real numbers. Let $C_n$ be the union of $n$ intervals as below: $$C_n = [a_1, b_1] \cup [a_2, b_2] \cup ... \cup [a_n, b_n].$$ We say $C_n$ is minimal if there is a subset $W$ of real numbers $R$ for which both of the following hold: (a) Every real number $r$ can be written as $r = c + w$ for some $c$ in $C_n$ and some $w$ in $W$, and (b) If $D$ is a subset of $C_n$ for which every real number $r$ can be written as $r = d + w$ for some $d$ in $D$ and some $w$ in $W$, then $D = C_n$. (i) Prove that every interval $C_1 = [a_1, b_1]$ is minimal. (ii) Prove that for every positive integer $n$, the set $C_n$ is minimal PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

Let $n$ be a positive integer and suppose that $\phi(n)=\frac{n}{k}$, where $k$ is the greatest perfect square such that $k \mid n$. Let $a_1,a_2,\ldots,a_n$ be $n$ positive integers such that $a_i=p_1^{a_1i} \cdot p_2^{a_2i} \cdots p_n^{a_ni}$, where $p_i$ are prime numbers and $a_{ji}$ are non-negative integers, $1 \leq i \leq n, 1 \leq j \leq n$. We know that $p_i\mid \phi(a_i)$, and if $p_i\mid \phi(a_j)$, then $p_j\mid \phi(a_i)$. Prove that there exist integers $k_1,k_2,\ldots,k_m$ with $1 \leq k_1 \leq k_2 \leq \cdots \leq k_m \leq n$ such that \[\phi(a_{k_{1}} \cdot a_{k_{2}} \cdots a_{k_{m}})=p_1 \cdot p_2 \cdots p_n.\]

For an odd prime number $p$, let $S$ denote the following sum taken modulo $p$: \[ S \equiv \frac{1}{1 \cdot 2} + \frac{1}{3\cdot 4} + \ldots + \frac{1}{(p-2)\cdot(p-1)} \equiv \sum_{i=1}^{\frac{p-1}{2}} \frac{1}{(2i-1) \cdot 2i} \pmod p\] Prove that $p^2 | 2^p - 2$ if and only if $S \equiv 0 \pmod p$.

Does there exist a $6$-digit number $A$ such that none of its $500 000$ multiples $A$, $2A$, $3A$, ..., $500 000A$ ends in $6$ identical digits? (S Tokarev)

We call a monic polynomial $P(x) \in \mathbb{Z}[x]$ [i]square-free mod n[/i] if there [u]dose not[/u] exist polynomials $Q(x),R(x) \in \mathbb{Z}[x]$ with $Q$ being non-constant and $P(x) \equiv Q(x)^2 R(x) \mod n$. Given a prime $p$ and integer $m \geq 2$. Find the number of monic [i]square-free mod p[/i] $P(x)$ with degree $m$ and coeeficients in $\{0,1,2,3,...,p-1\}$. [i]Proposed by Masud Shafaie[/i]

Let $n \geq 2$ be an integer. Define $x_i =1$ or $-1$ for every $i=1,2,3,\cdots, n$. Call an operation [i]adhesion[/i], if it changes the string $(x_1,x_2,\cdots,x_n)$ to $(x_1x_2, x_2x_3, \cdots ,x_{n-1}x_n, x_nx_1)$ . Find all integers $n \geq 2$ such that the string $(x_1,x_2,\cdots, x_n)$ changes to $(1,1,\cdots,1)$ after finitely [i]adhesion[/i] operations.

Denote by $S(k)$ the sum of the digits in the decimal representation of $k$. Prove that there are infinitely many $n\in \mathbb{Z_{+}}$ such that: ${S(2^{n}+n})<S(2^{n})$.

Let $p_n$ be the probability that $c+d$ is a perfect square when the integers $c$ and $d$ are selected independently at random from the set $\{1,2,\ldots,n\}$. Show that $\lim_{n\to\infty}p_n\sqrt n$ exists and express this limit in the form $r(\sqrt s-t)$, where $s$ and $t$ are integers and $r$ is a rational number.

Find a countable family of natural solutions to $ \frac{1}{a} +\frac{1}{b} +\frac{1}{ab}=\frac{1}{c} . $

The sum of all even positive integers less than $100$ those are not divisible by $3$ is (A): $938$, (B): $940$, (C): $1634$, (D): $1638$, (E): None of the above.

The natural numbers $x, y > 1$, are such that $x^2 + xy -y$ is the square of a natural number. Prove that $x + y + 1$ is a composite number.

Let $p$ be a prime number. Find all subsets $S\subseteq\mathbb Z/p\mathbb Z$ such that 1. if $a,b\in S$, then $ab\in S$, and 2. there exists an $r\in S$ such that for all $a\in S$, we have $r-a\in S\cup\{0\}$. [i]Proposed by Harun Khan[/i]

Consider the system of equations $$\log_x y +\log_y z + \log_z x =8$$ $$\log_{\log_y x}z = -3$$ $$\log_z y + \log_x z = 16$$ Find $z.$

How many of the first one hundred positive integers are divisible by all of the numbers $2,3,4,5$? $\text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 2 \qquad \text{(D)}\ 3 \qquad \text{(E)}\ 4$

Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$

Let $ \mathbb{A} \subset \mathbb{N} $ such that all elements in $ \mathbb{A} $ can be representable in the form of $ x^2+2y^2 $ , $ x,y \in \mathbb{N} $, and $ x>y $. Let $ \mathbb{B} \subset \mathbb{N} $ such that all elements in $ \mathbb{B} $ can be representable in the form of $\displaystyle \frac{a^3+b^3+c^3}{a+b+c} $ , $ a,b,c \in \mathbb{N} $, and $ a,b,c $ are distinct. a) Prove that $ \mathbb{A} \subset \mathbb{B} $. b) Prove that there exist infinitely many positive integers $n$ satisfy $ n \in \mathbb{B}$ and $ n \not \in \mathbb{A} $