Let $n>1$ be any integer. Define $f,g$ as functions from $\{0,1,2,\cdots,n-1 \}$ to $\{0,1,2,\cdots,n-1\}$ defined as \begin{align*} &f(i)=2i \pmod{n} \\ &g(i)=2i+1 \pmod{n} \end{align*} Show that for any integers $\ell,m \in \{0,1,2,\cdots,n-1 \}$ , there are infinitely many compositions of $f,g$ that map $\ell$ to $m$

On the board, we write the integers $1, 2, 3, \dots, 2019$. At each minute, we pick two numbers on the board $a$ and $b$, delete them, and write down the number $s(a + b)$ instead, where $s(n)$ denotes the sum of the digits of the integer $n$. Let $N$ be the last number on the board at the end. [list=a] [*] Is it possible to get $N = 19$? [*] Is it possible to get $N = 15$? [/list]

Does there exist a sequence $(a_n)_{n\in\mathbb N}$ of distinct positive integers such that: (i) $a_n<1999n$ for all $n$; (ii) none of the $a_n$ contains three decimal digits $1$?

For all primes $p \geq 3,$ define $F(p) = \sum^{\frac{p-1}{2}}_{k=1}k^{120}$ and $f(p) = \frac{1}{2} - \left\{ \frac{F(p)}{p} \right\}$, where $\{x\} = x - [x],$ find the value of $f(p).$

Find some four different natural numbers with the following property: if you add to the product of any two of them the product of the two remaining numbers. you get a prime number.

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: [list] [*] $(i)$ $f(n) \neq 0$ for at least one $n$; [*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; [*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$. [/list]

$m$ and $n$ are two nonnegative integers. In the Philosopher's Chess, The chessboard is an infinite grid of identical regular hexagons and a new piece named the Donkey moves on it as follows: Starting from one of the hexagons, the Donkey moves $m$ cells in one of the $6$ directions, then it turns $60$ degrees clockwise and after that moves $n$ cells in this new direction until it reaches it's final cell. At most how many cells are in the Philosopher's chessboard such that one cannot go from anyone of them to the other with a finite number of movements of the Donkey? [i]Proposed by Shayan Dashmiz[/i]

Determine if there exists a finite set $A$ of positive integers satisfying the following condition: for each $a\in{A}$ at least one of two numbers $2a$ and $\frac{a}{3}$ belongs to $A$.

BdMO National 2018 Higher Secondary P3 Nazia rolls four fair six-sided dice. She doesn’t see the results. Her friend Faria tells her that the product of the numbers is $144$. Faria also says the sum of the dice, $S$ satisfies $14\leq S\leq 18$ . Nazia tells Faria that $S$ cannot be one of the numbers in the set {$14,15,16,17,18$} if the product is $144$. Which number in the range {$14,15,16,17,18$} is an impossible value for $S$ ?

Prove that for any natural $n \geq 2$, the number $ \underbrace{2^{2^{\cdots^2}}}_{n \textrm{ times}}- \underbrace{2^{2^{\cdots^2}}}_{n-1 \textrm{ times}}$ is divisible by $n$. I know, that it is a very old problem :blush: but it is a problem from olympiad.

Let $2\leq N\leq 2022$ be a positive integer. Find the sum of all possible values of $N$ such that the product of the distinct divisors of $N$ is $N^{\frac{21}{2}}$.

Find all prime numbers $p$ and $q$ such that $2^2+p^2+q^2$ is also prime. Please remember to hide your solution. (by using the hide tags of course.. I don't literally mean that you should hide it :ninja: )

Let $\phi(n,m), m \neq 1$, be the number of positive integers less than or equal to $n$ that are coprime with $m.$ Clearly, $\phi(m,m) = \phi(m)$, where $\phi(m)$ is Euler’s phi function. Find all integers $m$ that satisfy the following inequality: \[\frac{\phi(n,m)}{n} \geq \frac{\phi(m)}{m}\] for every positive integer $n.$

[b]p1.[/b] In this problem, a half deck of cards consists of $26$ cards, each labeled with an integer from $1$ to $13$. There are two cards labeled $1$, two labeled $2$, two labeled $3$, etc. A certain math class has $13$ students. Each day, the teacher thoroughly shuffles a half deck of cards and deals out two cards to each student. Each student then adds the two numbers on the cards received, and the resulting $13$ sums are multiplied together to form a product $P$. If $P$ is an even number, the class must do math homework that evening. Show that the class always must do math homework. [b]p2.[/b] Twenty-six people attended a math party: Archimedes, Bernoulli, Cauchy, ..., Yau, and Zeno. During the party, Archimedes shook hands with one person, Bernoulli shook hands with two people, Cauchy shook hands with three people, and similarly up through Yau, who shook hands with $25$ people. How many people did Zeno shake hands with? Justify that your answer is correct and that it is the only correct answer. [b]p3.[/b] Prove that there are no integers $m, n \ge 1$ such that $$\sqrt{m+\sqrt{m+\sqrt{m+...+\sqrt{m}}}}=n$$ where there are $2006$ square root signs. [b]p4.[/b] Let $c$ be a circle inscribed in a triangle ABC. Let $\ell$ be the line tangent to $c$ and parallel to $AC$ (with $\ell \ne AC$). Let $P$ and $Q$ be the intersections of $\ell$ with $AB$ and $BC$, respectively. As $ABC$ runs through all triangles of perimeter $1$, what is the longest that the line segment $PQ$ can be? Justify your answer. [b]p5.[/b] Each positive integer is assigned one of three colors. Show that there exist distinct positive integers $x, y$ such that $x$ and $y$ have the same color and $|x -y|$ is a perfect square. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A sequence $\{an\}$ of positive integers is defined by \[a_n=\left[ n +\sqrt n + \frac 12 \right] , \qquad \forall n \in \mathbb N\] Determine the positive integers that occur in the sequence.

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.

Let $n\ge 2$ be an integer. We call an ordered $n$-tuple of integers primitive if the greatest common divisor of its components is $1$. Prove that for every finite set $H$ of primitive $n$-tuples, there exists a non-constant homogenous polynomial $f(x_1,x_2,\ldots,x_n)$ with integer coefficients whose value is $1$ at every $n$-tuple in $H$. [i]Based on the sixth problem of the 58th IMO, Brazil[/i]

For a positive integer $n$, numbers $2n+1$ and $3n+1$ are both perfect squares. Is it possible for $5n+3$ to be prime?

Find all the solutions $(a, b, c)$ in the natural numbers, verifying $1\le a \le b \le c$, of the equation$$\frac34=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}.$$

Find all integers \(a,b,c\) such that \(a^{2}=bc+4\) and \(b^{2}=ca+4\).

Find the greatest positive integer $x$ such that $23^{6+x}$ divides $2000!$

Determine all triplets off positive integers $ (a,b,c)$ for which $ \mid2^a\minus{}b^c\mid\equal{}1$

A student divides an integer $m$ by a positive integer $n$, where $n \le 100$, and claims that $\frac{m}{n}=0.167a_1a_2...$ . Show the student must be wrong.

Consider 2024 distinct prime numbers $p_1, p_2, \dots, p_{2024}$ such that \[p_1+p_2+\dots+p_{1012}=p_{1013}+p_{1014}+\dots+p_{2024}.\] Let $A=p_1p_2\dots p_{1012}$ and $B=p_{1013}p_{1014}\dots p_{2024}$. Prove that $|A-B|\geq 4$.

How many positive integers less than 500 have exactly 15 positive integer factors?