Let $c_1,c_2,\ldots,c_{6030}$ be 6030 real numbers. Suppose that for any 6030 real numbers $a_1,a_2,\ldots,a_{6030}$, there exist 6030 real numbers $\{b_1,b_2,\ldots,b_{6030}\}$ such that \[a_n = \sum_{k=1}^{n} b_{\gcd(k,n)}\] and \[b_n = \sum_{d\mid n} c_d a_{n/d}\] for $n=1,2,\ldots,6030$. Find $c_{6030}$. [i]Victor Wang.[/i]

Let $\varphi(n)$ denote the number of positive integers less than $n$ that are relatively prime to $n$. Prove that there exists a positive integer $m$ for which the equation $\varphi(n)=m$ has at least $2015$ solutions in $n$. [i]Proposed by Iurie Boreico[/i]

Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$: a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$ b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that the following conditions are true for every pair of positive integers $(x, y)$: $(i)$: $x$ and $f(x)$ have the same number of positive divisors. $(ii)$: If $x \nmid y$ and $y \nmid x$, then: $$\gcd(f(x), f(y)) > f(\gcd(x, y))$$

Let $(a_n)$ be a sequence with $a_1=0$ and $a_{n+1}=2+a_n$ for odd $n$ and $a_{n+1}=2a_n$ for even $n$. Prove that for each prime $p>3$, the number \begin{align*} b=\frac{2^{2p}-1}{3} \mid a_n \end{align*} for infinitely many values of $n$

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

In a football season, even number $n$ of teams plays a simple series, i.e. each team plays once against each other team. Show that ona can group the series into $n-1$ rounds such that in every round every team plays exactly one match.

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

A function $f_n(x)\ (n=0,\ 1,\ 2,\ 3,\ \cdots)$ satisfies the following conditions: (i) $f_0(x)=e^{2x}+1$. (ii) $f_n(x)=\int_0^x (n+2t)f_{n-1}(t)dt-\frac{2x^{n+1}}{n+1}\ (n=1,\ 2,\ 3,\ \cdots).$ Find $\sum_{n=1}^{\infty} f_n'\left(\frac 12\right).$

Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that $$f(x + f(y)) = f(x) + f(y)$$ for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.

Let $S$ be a set of integers (not necessarily positive) such that (a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$; (b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$. Prove that $S$ is the set of all integers.

Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times{2n}$ grid of unit squares. A [i]domino[/i] is a $1\times2{}$ or $2\times{1}$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is [i]domino-tileable[/i] if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. [i]Note[/i]: The empty set is domino tileable. An [i]up-right path[/i] is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares. Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.

For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number \[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}} \] but $ 2^{3k \plus{} 1}$ does not. [i]Author: Waldemar Pompe, Poland[/i]

Let $0!!=1!!=1$ and $n!!=n\cdot (n-2)!!$ for all integers $n\geq 2$. Find all positive integers $n$ such that \[\dfrac{(2^n+1)!!-1}{2^{n+1}}\] is an integer.