Find the number of ordered pairs of integers $(m,n)$ such that $0 \le m,n \le 2023$ and $$m^2 \equiv \sum_{d \mid 2023} n^d \pmod{2024}.$$

Determine all integers $n\geq 1$ for which the numbers $1,2,\ldots,n$ may be (re)ordered as $a_1,a_2,\ldots,a_n$ in such a way that the average $\dfrac {a_1+a_2+\cdots + a_k} {k}$ is an integer for all values $1\leq k\leq n$. (Dan Schwarz)

Let $m$, $n$ be positive integers. Prove that, for some positive integer $a$, each of $\phi(a)$, $\phi(a+1)$, $\cdots$, $\phi(a+n)$ is a multiple of $m$.

Let a sequence $\{a_n\}$, $n \in \mathbb{N}^{*}$ given, satisfying the condition \[0 < a_{n+1} - a_n \leq 2001\] for all $n \in \mathbb{N}^{*}$ Show that there are infinitely many pairs of positive integers $(p, q)$ such that $p < q$ and $a_p$ is divisor of $a_q$.

For each non-negative integer $n$, let $u_n = \left( 2+\sqrt{5} \right)^n + \left( 2-\sqrt{5} \right)^n$. a) Prove that $u_n$ is a positive integer for all $n \geq 0$. When $n$ changes, what is the largest possible remainder when $u_n$ is divided by $24$? b) Find all pairs of positive integers $(a, b)$ such that $a, b < 500$ and for all odd positive integers $n$, $u_n \equiv a^n - b^n \pmod {1111}$.

Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$ [i]Proposed by Ross Atkins, Australia [/i]

The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$

Prove that for every square-free integer $n>1$, there exists a prime number $p$ and an integer $m$ satisfying \[ p \mid n \quad \text{and} \quad n \mid p^2+p\cdot m^p. \]

Prove that for each positive integer $n$, there exist $n$ consecutive positive integers none of which is an integral power of a prime number.

Prove that ${d((n^2 +1)}^2)$ does not become monotonic from any given point onwards.

We define $\mathbb F_{101}[x]$ as the set of all polynomials in $x$ with coefficients in $\mathbb F_{101}$ (the integers modulo $101$ with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of $x^k$ are equal in $\mathbb F_{101}$ for each nonnegative integer $k$. For example, $(x+3)(100x+5)=100x^2+2x+15$ in $\mathbb F_{101}[x]$ because the corresponding coefficients are equal modulo $101$. We say that $f(x)\in\mathbb F_{101}[x]$ is \emph{lucky} if it has degree at most $1000$ and there exist $g(x),h(x)\in\mathbb F_{101}[x]$ such that \[f(x)=g(x)(x^{1001}-1)+h(x)^{101}-h(x)\] in $\mathbb F_{101}[x]$. Find the number of lucky polynomials. [i]Proposed by Michael Ren.[/i]

Determine all polynomials $f$ with integer coefficients such that $f(p)$ is a divisor of $2^p-2$ for every odd prime $p$. [I]Proposed by Italy[/i]

Let $\mathbb{N}_0$ denote the set of all nonnegative integers. Determine all functions $f:\mathbb{N}_0\to\mathbb{N}_0$ with the following two properties: [list] [*] $0\le f(x)\le x^2$ for all $x\in\mathbb{N}_0$ [*] $x-y$ divides $f(x)-f(y)$ for all $x,y\in\mathbb{N}_0$ with $x>y$[/list]

Which one statisfies $n^{29} \equiv 7 \pmod {65}$? $ \textbf{(A)}\ 37 \qquad \textbf{(B)}\ 39 \qquad \textbf{(C)}\ 43 \qquad \textbf{(D)}\ 46 \qquad \textbf{(E)}\ 55$

The positive integers $a$, $p$, $q$ and $r$ are greater than $1$ and are such that $p$ divides $aqr+1$, $q$ divides $apr+1$ and $r$ divides $apq+1$. Prove that: a) There are infinitely many such quadruples $(a,p,q,r)$. b) For each such quadruple we have $a\geq \frac{pqr-1}{pq+qr+rp}$.