Let $t(n)$ be the sum of the digits in the binary representation of a positive integer $n,$ and let $k \geq 2$ be an integer. [b]a.[/b] Show that there exists a sequence $(a_i)_{i=1}^{\infty}$ of integers such that $a_m \geq 3$ is an odd integer and $t(a_1a_2 \cdots a_m)=k$ for all $m \geq 1.$ [b]b.[/b] Show that there is an integer $N$ such that $t(3 \cdot 5 \cdots (2m+1))>k$ for all integers $m \geq N.$

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

Let $k>2$ be a positive integer. Elise and Xavier play a game that has four steps, in this order. [list=1] [*]Elise picks $2$ nonzero digits $(1-9)$, called $e$ and $f$. [*]Xavier then picks $k$ nonzero digits $(1-9)$, called $x_1,\cdots,x_k$. [*]Elise picks any positive integer $d$. [*]Xaiver picks an integer $b>10$.[/list] Each player's choices are known to the other player when the choices are made. The winner is determined as follows. Elise writes down the two-digit base $b$ number $ef_b$. Next, Xavier writes the $k$-digit base $b$ number that is constructed by concatenating his digits, \[(x_1\cdots x_k)_b.\] They then compute the greatest common divisor (gcd) of these two numbers. If this gcd is greater than or equal to the integer $d$ then Xavier wins. Otherwise Elise wins. (As an example game for $k=3$, Elise chooses the digits $(e, f) = (2, 4)$, Xavier chooses $(4, 4, 8)$, and then Elise picks $d = 100$. Xavier picks base $b = 25$. The base-25 numbers $2425$ and $44825$ are, respectively, equal to $54$ and $2608$. The greatest common divisor of these two is $2$, which is much less than $100$, so Elise wins handily.) Find all $k$ for which Xavier can force a win, no matter how Elise plays.

A right parallelepiped (i.e. a parallelepiped one of whose edges is perpendicular to a face) is given. Its vertices have integral coordinates, and no other points with integral coordinates lie on its faces or edges. Prove that the volume of this parallelepiped is a sum of three perfect squares. [i]Proposed by A. Golovanov[/i]

Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$ [i]Proposed by Daniel Liu[/i]

Determine all pairs $(x, y)$ of positive integers such that for $d = gcd(x, y)$ the equation $$xyd = x + y + d^2$$ holds. [i](Walther Janous)[/i]

Let $ a > b > 1$ be relatively prime positive integers. Define the weight of an integer $ c$, denoted by $ w(c)$ to be the minimal possible value of $ |x| \plus{} |y|$ taken over all pairs of integers $ x$ and $ y$ such that \[ax \plus{} by \equal{} c.\] An integer $ c$ is called a [i]local champion [/i]if $ w(c) \geq w(c \pm a)$ and $ w(c) \geq w(c \pm b)$. Find all local champions and determine their number. [i]Proposed by Zoran Sunic, USA[/i]

A number $N$ has three digits when expressed in base $7$. When $N$ is expressed in base $9$ the digits are reversed. Then the middle digit is: $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$

Prove that for all integers $ m$ and $ n$, the inequality \[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\] holds. [i]Nanang Susyanto, Jogjakarta [/i]

Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way? $ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$

Let $n$ be an odd positive integer with $n > 1$ and let $a_1, a_2,... , a_n$ be positive integers such that gcd $(a_1, a_2,... , a_n) = 1$. Let $d$ = gcd $(a_1^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, a_2^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, ... , a_n^n + a_1\cdot a_2 \cdot \cdot \cdot a_n)$. Show that the possible values of $d$ are $d = 1, d = 2$

What is the units digit of $ 13^{2003}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Find the number of pairs $(a, b)$ of positive integers with the property that the greatest common divisor of $a$ and $ b$ is equal to $1\cdot 2 \cdot 3\cdot ... \cdot50$, and the least common multiple of $a$ and $ b$ is $1^2 \cdot 2^2 \cdot 3^2\cdot ... \cdot 50^2$.

Find all ordered pairs of integers $(a,b)$ such that $3^a + 7^b$ is a perfect square.

For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies \[ 4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)} \]

There are $n$ natural numbers written on a blackboard, where $n\in\mathbb{N},\ n\geq 2$. During each step two chosen numbers $a,b$, having the property that none of them divides the other, are replaced by their greatest common divisor and least common multiple. Prove that after a number of steps, all the numbers on the blackboard cease modifying. Prove that the respective number of steps is at most $(n-1)!$.

Let $n$ be integer, $n>1.$ An element of the set $M=\{ 1,2,3,\ldots,n^2-1\}$ is called [i]good[/i] if there exists some element $b$ of $M$ such that $ab-b$ is divisible by $n^2.$ Furthermore, an element $a$ is called [i]very good[/i] if $a^2-a$ is divisible by $n^2.$ Let $g$ denote the number of [i]good[/i] elements in $M$ and $v$ denote the number of [i]very good[/i] elements in $M.$ Prove that \[v^2+v \leq g \leq n^2-n.\]

Natural numbers $a$ and $b$ are relatively prime. Prove that the greatest common divisor of $(a+b)$ and $(a^2+b^2)$ is either $1$ or $2$.

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N} $ satisfying \[ f(mn) = \operatorname{lcm} (m,n) \cdot \gcd( f(m), f(n) ) \] for all positive integer $m,n$.

Denote the set of all positive integers by $\mathbb{N}$, and the set of all ordered positive integers by $\mathbb{N}^2$. For all non-negative integers $k$, define [i]good functions of order k[/i] recursively for all non-negative integers $k$, among all functions from $\mathbb{N}^2$ to $\mathbb{N}$ as follows: (i) The functions $f(a,b)=a$ and $f(a,b)=b$ are both good functions of order $0$. (ii) If $f(a,b)$ and $g(a,b)$ are good functions of orders $p$ and $q$, respectively, then $\gcd(f(a,b),g(a,b))$ is a good function of order $p+q$, while $f(a,b)g(a,b)$ is a good function of order $p+q+1$. Prove that, if $f(a,b)$ is a good function of order $k\leq \binom{n}{3}$ for some positive integer $n\geq 3$, then there exist a positive integer $t\leq \binom{n}{2}$ and $t$ pairs of non-negative integers $(x_1,y_1),\ldots,(x_n,y_n)$ such that $$f(a,b)=\gcd(a^{x_1}b^{y_1},\ldots,a^{x_t}b^{y_t})$$ holds for all positive integers $a$ and $b$. [i]Proposed by usjl[/i]

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Consider $5$ distinct positive integers. Can their mean be a)Exactly $3$ times larger than their largest common divisor? b)Exactly $2$ times larger than their largest common divisor?

On the table there are $k \ge 3$ heaps of $1, 2, \dots , k$ stones. In the first step, we choose any three of the heaps, merge them into a single new heap, and remove $1$ stone from this new heap. Thereafter, in the $i$-th step ($i \ge 2$) we merge some three heaps containing more than $i$ stones in total and remove $i$ stones from the new heap. Assume that after a number of steps a single heap of $p$ stones remains on the table. Show that the number $p$ is a perfect square if and only if so are both $2k + 2$ and $3k + 1$. Find the least $k$ with this property.

Show that there exist infinitely many pairs $(a, b)$ of positive integers with the property that $a+b$ divides $ab+1$, $a-b$ divides $ab-1$, $b>1$ and $a>b\sqrt{3}-1$

Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.