Find all sets $(a, b, c)$ of different positive integers $a$, $b$, $c$, for which: [b]*[/b] $2a - 1$ is a multiple of $b$; [b]*[/b] $2b - 1$ is a multiple of $c$; [b]*[/b] $2c - 1$ is a multiple of $a$.

Prove that there exists a function $f : \mathbb{N} \mapsto \mathbb{N}$ that satisfies the following: [color=#FFFFFF]___[/color]1. For all positive integers $m, n$ we have \[\gcd(|f(m)-f(n)|, f(mn)) = f(\gcd(m, n))\] [color=#FFFFFF]___[/color]2. For all positive integers $m$, we have $f(f(m)) = f(m)$. [color=#FFFFFF]___[/color]3. For all positive integers $k$, there exists a positive integer $n$ with $2024^{k} \mid f(n)$. [i]Proposed by MV Adhitya, Archit Manas[/i]

Find all functions $f:\mathbb{N}^* \rightarrow \mathbb{N}$ such that [list] [*] $f(x \cdot y) = f(x) + f(y)$ [*] $f(30) = 0$ [*] $f(x)=0$ always when the units digit of $x$ is $7$ [/list]

Find all pairs of integers $x, y$ such that $y^5 + 2xy = x^2 + 2y^4.$ .

Find all positive integer values of $n$ such that the value of the $$\frac{2^{n!}-1}{2^n-1}$$ is a square of an integer.

Let $k<<n$ denote that $k<n$ and $k\mid n$. Let $f:\{1,2,...,2013\}\rightarrow \{1,2,...,M\}$ be such that, if $n\leq 2013$ and $k<<n$, then $f(k)<<f(n)$. What’s the least possible value of $M$?

We will say that a natural number is [i]acceptable[/i] if it has at most $9$ distinct prime divisors. There is a stack of $100!=1\times2\times\cdots\times100$ stones. A [i]legal move[/i] consists in removing $k$ stones from the stack, where $k$ is an acceptable number. Two players, Lucas and Nicolas, take turns making legal moves; Lucas starts the game. The one who removes the last stone wins. Determine which of the players has a winning strategy and describe this strategy.

Find the least positive integers $m,k$ such that a) There exist $2m+1$ consecutive natural numbers whose sum of cubes is also a cube. b) There exist $2k+1$ consecutive natural numbers whose sum of squares is also a square. The author is Vasile Suceveanu

Let $p$ be a given prime. For each prime $r$, we defind the function as following $F(r) =\frac{(p^{rp} - 1) (p - 1)}{(p^r - 1) (p^p - 1)}$. 1. Show that $F(r)$ is a positive integer for any prime $r \ne p$. 2. Show that $F(r)$ and $F(s)$ are coprime for any primes $r$ and $s$ such that $r \ne p, s \ne p$ and $r \ne s$. 3. Fix a prime $r \ne p$. Show that there is a prime divisor $q$ of $F(r)$ such that $p| q - 1$ but $p^2 \nmid q - 1$.

Find all pairs of integers $(a,b)$ satisfying the equation $a^7(a-1)=19b(19b+2)$.

In Eldorado a year has $20$ months, and each month has $20$ days. One day Brigi asked Adél who lives in Eldorado what day her birthday is. Adél answered that she is only going to tell her the product of the month and the day in her birthday. (For example, if she was born on the $19$th day of the $4$th month, she would say $4 \cdot 19 = 76$.) From this, Brigi was able to tell Adél’s birthday. Based on this information, how many days of the year can be Adél’s birthday?

Find a number that increases by a factor of $1996$ if the digits in the first and fifth places after the decimal place are swapped in its decimal notation.

Find the four smallest four-digit numbers that meet the following condition: by dividing by $2$, $3$, $4$, $5$ or $6$ the remainder is $ 1$.

Find all triples $(a, b, c)$ of natural numbers such that the sets $$\{ gcd (a, b), gcd(b, c), gcd(c, a), lcm (a, b), lcm (b, c), lcm (c, a)\}$$ and $$\{2, 3, 5, 30, 60\}$$ are the same. Remark: For example, the sets $\{1, 2013\}$ and $\{1, 1, 2013\}$ are equal.

For every $n \in \mathbb{N}$, there exist integers $k$ such that $n | k$ and $k$ contains only zeroes and ones in its decimal representation. Let $f(n)$ denote the least possible number of ones in any such $k$. Determine whether there exists a constant $C$ such that $f(n) < C$ for all $n \in \mathbb{N}$.

Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.

With the digits $1, 2, 3,. . . . . . , 9$ three-digit numbers are written such that the sum of the three digits is $17$. How many numbers can be written?

A natural number $n\ge5$ leaves the remainder $2$ when divided by $3$. Prove that the square of $n$ is not a sum of a prime number and a perfect square.

Consider the integers formed using the digits $0,1,2,3,4,5,6$, without repetition. Find the largest multiple of $55$. Justify your answer.

José has the following list of numbers: $100, 101, 102, ..., 118, 119, 120$. He calculates the sum of each of the pairs of different numbers that you can put together. How many different prime numbers can you get calculating those sums?

Let $p$ and $q$ be two different prime numbers. Prove that there are two positive integers, $a$ and $b$, such that the arithmetic mean of the divisors of $n=p^aq^b$ is an integer.

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

[b]p1.[/b] Prove that $x = 2$ is the only real number satisfying $3^x + 4^x = 5^x$. [b]p2.[/b] Show that $\sqrt{9 + 4\sqrt5} -\sqrt{9 - 4\sqrt5}$ is an integer. [b]p3.[/b] Two players $A$ and $B$ play a game on a round table. Each time they take turn placing a round coin on the table. The coin has a uniform size, and this size is at least $10$ times smaller than the table size. They cannot place the coin on top of any part of other coins, and the whole coin must be on the table. If a player cannot place a coin, he loses. Suppose $A$ starts first. If both of them plan their moves wisely, there will be one person who will always win. Determine whether $A$ or $B$ will win, and then determine his winning strategy. [b]p4.[/b] Suppose you are given $4$ pegs arranged in a square on a board. A “move” consists of picking up a peg, reflecting it through any other peg, and placing it down on the board. For how many integers $1 \le n \le 2013$ is it possible to arrange the $4$ pegs into a [i]larger [/i] square using exactly $n$ moves? Justify your answers. [b]p5.[/b] Find smallest positive integer that has a remainder of $1$ when divided by $2$, a remainder of $2$ when divided by $3$, a remainder of $3$ when divided by $5$, and a remainder of $5$ when divided by $7$. [b]p6.[/b] Find the value of $$\sum_{m|496,m>0} \frac{1}{m},$$ where $m|496$ means $496$ is divisible by $m$. [b]p7.[/b] What is the value of $${100 \choose 0}+{100 \choose 4}+{100 \choose 8}+ ... +{100 \choose 100}?$$ [b]p8.[/b] An $n$-term sequence $a_0, a_1, ...,a_n$ will be called [i]sweet [/i] if, for each $0 \le i \le n -1$, $a_i$ is the number of times that the number $i$ appears in the sequence. For example, $1, 2, 1,0$ is a sweet sequence with $4$ terms. Given that $a_0$, $a_1$, $...$, $a_{2013}$ is a sweet sequence, find the value of $a^2_0+ a^2_1+ ... + a^2_{2013}.$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there are infinitely many positive integers $ n$ such that $ n^{2} \plus{} 1$ has a prime divisor greater than $ 2n \plus{} \sqrt {2n}$. [i]Author: Kestutis Cesnavicius, Lithuania[/i]

Let $m, n$ integers such that satisfy $$m + n\sqrt2 = \left(1 +\sqrt2\right)^{2010} .$$ Find the remainder that is obtained when dividing $n$ by $5$.