Prove that the set of rational-valued, multiplicative arithmetical functions and the set of complex rational-valued, multiplicative arithmetical functions form isomorphic groups with the convolution operation $ f \circ g$ defined by \[{ (f \circ g)(n)= %Error. "displatmath" is a bad command. \sum_{d|n} f(d)g(\frac nd}).\] (We call a complex number $ \textit{complex rational}$, if its real and imaginary parts are both rational.) [i]B. Csakany[/i]

Fix a positive integer $n\geq 3$. Does there exist infinitely many sets $S$ of positive integers $\lbrace a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n\rbrace$, such that $\gcd (a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n)=1$, $\lbrace a_i\rbrace _{i=1}^n$, $\lbrace b_i\rbrace _{i=1}^n$ are arithmetic progressions, and $\prod_{i=1}^n a_i = \prod_{i=1}^n b_i$?

Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.

Determine all non-constant monic polynomials $f(x)$ with integer coefficients for which there exists a natural number $M$ such that for all $n \geq M$, $f(n)$ divides $f(2^n) - 2^{f(n)}$ [i] Proposed by Anant Mudgal [/i]

Let $n$ be a natural integer and let $k$ be the number of ways to write $n$ as the sum of one or more consecutive natural integers. Prove that $k$ is equal to the number of odd positive divisors of $n$. Example: $9$ has three positive odd divisors and $9 = 9$, $9 = 4 + 5$, $9 = 2 + 3 + 4$.

Mark and William are playing a game with a stored value. On his turn, a player may either multiply the stored value by $2$ and add $1$ or he may multiply the stored value by $4$ and add $3$. The first player to make the stored value exceed $2^{100}$ wins. The stored value starts at $1$ and Mark goes first. Assuming both players play optimally, what is the maximum number of times that William can make a move? (By optimal play, we mean that on any turn the player selects the move which leads to the best possible outcome given that the opponent is also playing optimally. If both moves lead to the same outcome, the player selects one of them arbitrarily.)

There are $n$ natural numbers written on the board. Every move, we could erase $a,b$ and change it to $\gcd(a,b)$ and $\text{lcm}(a,b) - \gcd(a,b)$. Prove that in finite number of moves, all numbers in the board could be made to be equal.

Define Fibonacci sequence $\{F\}_{n=0}^{\infty}$ as $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n +F_{n-1}$ for every integer $n > 1$. Determine all quadruples $(a, b, c,n)$ of positive integers with a $< b < c$ such that each of $a, b,c,a + n, b + n,c + 2n$ is a term of the Fibonacci sequence.

Find all solutions for positive integers $(x,y,k,m)$ such that \[ 20x^k+24y^m = 2024\] with $k, m > 1$

[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find any two consecutive natural numbers, each of which is divisible by the square of the sum of its digits.

Determine all sequences $a_0 , a_1 , a_2 , \ldots$ of positive integers with $a_0 \ge 2015$ such that for all integers $n\ge 1$: (i) $a_{n+2}$ is divisible by $a_n$ ; (ii) $|s_{n+1} - (n + 1)a_n | = 1$, where $s_{n+1} = a_{n+1} - a_n + a_{n-1} - \cdots + (-1)^{n+1} a_0$ . [i]Proposed by Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

What are last three digits of $2^{2^{2004}}$ ?

Let $r$ be the remainder when $2017^{2025!}-1$ is divided by $2025!.$ Compute $\tfrac{r}{2025!}.$ (Note that $2017$ is prime.)

Prove that one can arrange all positive divisors of any given positive integer around a circle so that for any two neighboring numbers one is divisible by another.

Prove that there is not a positive integer $n$ such that numbers $(n+1)2^n, (n+3)2^{n+2}$ are both perfect squares.

Given a real sequence $\left \{ x_n \right \}_{n=1}^{\infty}$ with $x_1^2 = 1$. Prove that for each integer $n \ge 2$, $$\sum_{i|n}\sum_{j|n}\frac{x_ix_j}{\textup{lcm} \left ( i,j \right )} \ge \prod_{\mbox{\tiny$\begin{array}{c} p \: \textup{is prime} \\ p|n \end{array}$} }\left ( 1-\frac{1}{p} \right ). $$

We call a positive integer $q$ a $convenient \quad denominator$ for a real number $\alpha$ if $\displaystyle |\alpha - \dfrac{p}{q}|<\dfrac{1}{10q}$ for some integer $p$. Prove that if two irrational numbers $\alpha$ and $\beta$ have the same set of convenient denominators then either $\alpha+\beta$ or $\alpha- \beta$ is an integer.

How many zeros are there at the end of $792!$ when written in base $10$?

For two non-negative integers $i, j$, create a new integer $i \# j$ defined as the following: Express the two numbers in base $2$, and compare each digit. If their $k$th digit is the same, then the $k$th digit of $i \# j$ is $0$. If their $k$th digit is different, then the $k$th digit of $i \# j$ is $1$(of course we are talking in base $2$). For instance, $3 \# 5=6$. Show that for arbitrary positive integer $n$, the number can be expressed with finite operations of $\#$s and integers of the form $2^k-1$.

[hide=B stands for Bernoulli, G stands for Germain]they had two problem sets under those two names[/hide] [u]Set 4[/u] [b]B16 / G11[/b] Let triangle $ABC$ be an equilateral triangle with side length $6$. If point $D$ is on $AB$ and point $E$ is on $BC$, find the minimum possible value of $AD + DE + CE$. [b]B17 / G12[/b] Find the smallest positive integer $n$ with at least seven divisors. [b]B18 / G13[/b] Square $A$ is inscribed in a circle. The circle is inscribed in Square $B$. If the circle has a radius of $10$, what is the ratio between a side length of Square $A$ and a side length of Square $B$? [b]B19 / G14[/b] Billy Bob has $5$ distinguishable books that he wants to place on a shelf. How many ways can he order them if he does not want his two math books to be next to each other? [b]B20 / G15[/b] Six people make statements as follows: Person $1$ says “At least one of us is lying.” Person $2$ says “At least two of us are lying.” Person $3$ says “At least three of us are lying.” Person $4$ says “At least four of us are lying.” Person $5$ says “At least five of us are lying.” Person $6$ says “At least six of us are lying.” How many are lying? [u]Set 5[/u] [b]B21 / G16[/b] If $x$ and $y$ are between $0$ and $1$, find the ordered pair $(x, y)$ which maximizes $(xy)^2(x^2 - y^2)$. [b]B22 / G17[/b] If I take all my money and divide it into $12$ piles, I have $10$ dollars left. If I take all my money and divide it into $13$ piles, I have $11$ dollars left. If I take all my money and divide it into $14$ piles, I have $12$ dollars left. What’s the least amount of money I could have? [b]B23 / G18[/b] A quadratic equation has two distinct prime number solutions and its coefficients are integers that sum to a prime number. Find the sum of the solutions to this equation. [b]B24 / G20[/b] A regular $12$-sided polygon is inscribed in a circle. Gaz then chooses $3$ vertices of the polygon at random and connects them to form a triangle. What is the probability that this triangle is right? [b]B25 / G22[/b] A book has at most $7$ chapters, and each chapter is either $3$ pages long or has a length that is a power of $2$ (including $1$). What is the least positive integer $n$ for which the book cannot have $n$ pages? [u]Set 6[/u] [b]B26 / G26[/b] What percent of the problems on the individual, team, and guts rounds for both divisions have integer answers? [b]B27 / G27[/b] Estimate $12345^{\frac{1}{123}}$. [b]B28 / G28[/b] Let $O$ be the center of a circle $\omega$ with radius $3$. Let $A, B, C$ be randomly selected on $\omega$. Let $M$, $N$ be the midpoints of sides $BC$, $CA$, and let $AM$, $BN$ intersect at $G$. What is the probability that $OG \le 1$? [b]B29 / G29[/b] Let $r(a, b)$ be the remainder when $a$ is divided by $b$. What is $\sum^{100}_{i=1} r(2^i , i)$? [b]B30 / G30[/b] Bongo flips $2023$ coins. Call a run of heads a sequence of consecutive heads. Say a run is maximal if it isn’t contained in another run of heads. For example, if he gets $HHHT T HT T HHHHT H$, he’d have maximal runs of length $3, 1, 4, 1$. Bongo squares the lengths of all his maximal runs and adds them to get a number $M$. What is the expected value of $M$? - - - - - - [b]G19[/b] Let $ABCD$ be a square of side length $2$. Let $M$ be the midpoint of $AB$ and $N$ be the midpoint of $AD$. Let the intersection of $BN$ and $CM$ be $E$. Find the area of quadrilateral $NECD$. [b]G21[/b] Quadrilateral $ABCD$ has $\angle A = \angle D = 60^o$. If $AB = 8$, $CD = 10$, and $BC = 3$, what is length $AD$? [b]G23[/b] $\vartriangle ABC$ is an equilateral triangle of side length $x$. Three unit circles $\omega_A$, $\omega_B$, and $\omega_C$ lie in the plane such that $\omega_A$ passes through $A$ while $\omega_B$ and $\omega_C$ are centered at $B$ and $C$, respectively. Given that $\omega_A$ is externally tangent to both $\omega_B$ and $\omega_C$, and the center of $\omega_A$ is between point $A$ and line $\overline{BC}$, find $x$. [b]G24[/b] For some integers $n$, the quadratic function $f(x) = x^2 - (6n - 6)x - (n^2 - 12n + 12)$ has two distinct positive integer roots, exactly one out of which is a prime and at least one of which is in the form $2^k$ for some nonnegative integer $k$. What is the sum of all possible values of $n$? [b]G25[/b] In a triangle, let the altitudes concur at $H$. Given that $AH = 30$, $BH = 14$, and the circumradius is $25$, calculate $CH$ PS. You should use hide for answers. Rest problems have been posted [url=https://artofproblemsolving.com/community/c3h3132167p28376626]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$ \forall n > 0, n \in \mathbb{Z},$ there exists uniquely determined integers $ a_n, b_n, c_n \in \mathbb{Z}$ such \[ \left(1 \plus{} 4 \cdot \sqrt[3]{2} \minus{} 4 \cdot \sqrt[3]{4} \right)^n \equal{} a_n \plus{} b_n \cdot \sqrt[3]{2} \plus{} c_n \cdot \sqrt[3]{4}.\] Prove that $ c_n \equal{} 0$ implies $ n \equal{} 0.$

A positive integer $x$ is $k$-[i]equivocal [/i] if there exists two positive integers $b$, $b'$ such that when $x$ is represented in base $b$ and base $b'$, the two representations have digit sequences of length $k$ that are permutations of each other. The smallest $2$-equivocal number is $7$, since $7$ is $21$ in base $3$ and $12$ in base $5$. Find the smallest $3$-equivocal number.

Solve the equation $p^2-pq-q^3=1$ in prime numbers. [i]A. Golovanov[/i]

A positive integer number $N{}$ is divisible by 2020. All its digits are different and if any two of them are swapped, the resulting number is not divisible by 2020. How many digits can such a number $N{}$ have? [i]Sergey Tokarev[/i]