Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist [i]two[/i] positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.

Let $\mathbb{P}$ be the set of all prime numbers. Find all functions $f:\mathbb{P}\rightarrow\mathbb{P}$ such that: $$f(p)^{f(q)}+q^p=f(q)^{f(p)}+p^q$$ holds for all $p,q\in\mathbb{P}$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $f(x)$ be the polynomial $\prod_{k=1}^{50} \bigl( x - (2k-1) \bigr)$. Let $c$ be the coefficient of $x^{48}$ in $f(x)$. When $c$ is divided by 101, what is the remainder? (The remainder is an integer between 0 and 100.)

How many different remainders can result when the $100$th power of an integer is divided by $125$? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }5 \qquad \textbf{(D) }25 \qquad \textbf{(E) }125 \qquad $

Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

Which of the following is equivalent to $$(2+3)(2^2+3^2)(2^4+3^4)(2^8+3^8)(2^{16}+3^{16})(2^{32}+3^{32})(2^{64}+3^{64})?$$ $\textbf{(A) }3^{127}+2^{127} \qquad \textbf{(B) }3^{127}+2^{127}+2\cdot 3^{63}+3\cdot 2^{63} \qquad \textbf{(C) }3^{128}-2^{128} \qquad \textbf{(D) }3^{128}+2^{128} \qquad \textbf{(E) }5^{127}$

Let $n$ be an integer with $n \ge 2$. Show that $n$ does not divide $2^{n}-1$.

Fix a prime number $ p > 5$. Let $ a,b,c$ be integers no two of which have their difference divisible by $ p$. Let $ i,j,k$ be nonnegative integers such that $ i \plus{} j \plus{} k$ is divisible by $ p \minus{} 1$. Suppose that for all integers $ x$, the quantity \[ (x \minus{} a)(x \minus{} b)(x \minus{} c)[(x \minus{} a)^i(x \minus{} b)^j(x \minus{} c)^k \minus{} 1]\] is divisible by $ p$. Prove that each of $ i,j,k$ must be divisible by $ p \minus{} 1$. [i]Kiran Kedlaya and Peter Shor.[/i]

Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

Let $a, b$ and $n$ be positive integers with $a>b$ such that all of the following hold: i. $a^{2021}$ divides $n$, ii. $b^{2021}$ divides $n$, iii. 2022 divides $a-b$. Prove that there is a subset $T$ of the set of positive divisors of the number $n$ such that the sum of the elements of $T$ is divisible by 2022 but not divisible by $2022^2$. [i]Proposed by Silouanos Brazitikos, Greece[/i]

Given an even positive integer $m$, find all positive integers $n$ for which there exists a bijection $f:[n]\to [n]$ so that, for all $x,y\in [n]$ for which $n\mid mx-y$, $$(n+1)\mid f(x)^m-f(y).$$ Note: For a positive integer $n$, we let $[n] = \{1,2,\dots, n\}$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]