Find all positive integers $n$ for which there exists an integer multiple of $2022$ such that the sum of the squares of its digits is equal to $n$.

Let $ k > 1$ be an integer, and consider the infinite array given by the integer lattice in the first quadrant of the plane, filled with real numbers. The array is said to be constant if all its elements are equal in value. The array is said to be $ k$-balanced if it is non-constant, and the sums of the elements of any $ k\times k$ sub-square have a constant value $ v_k$. An array which is both $ p$-balanced and $ q$-balanced will be said to be $ (p, q)$-balanced, or just doubly-balanced, if there is no confusion as to which $ p$ and $ q$ are meant. If $p, q$ are relatively prime, the array is said to be co-prime. We will call $ (M\times N)$-seed a $ M \times N$ array, anchored with its lower left corner in the origin of the plane, which extended through periodicity in both dimensions in the plane results into a $ (p, q)$-balanced array; more precisely, if we denote the numbers in the array by $ a_{ij}$ , where $ i, j$ are the coordinates of the lower left corner of the unit square they lie in, we have, for all non-negative integers $ i, j$ \[ a_{i \plus{} M,j} \equal{} a_{i,j} \equal{} a_{i,j \plus{} N}\] (a) Prove that $ q^2v_p \equal{} p^2v_q$ for a $ (p, q)$-balanced array. (b) Prove that more than two different values are used in a co-prime $ (p,q)$-balanced array. Show that this is no longer true if $ (p, q) > 1$. (c) Prove that any co-prime $ (p, q)$-balanced array originates from a seed. (d) Show there exist $ (p, q)$-balanced arrays (using only three different values) for arbitrary values $ p, q$. (e) Show that neither a $ k$-balanced array, nor a $ (p, q)$-balanced array if $ (p, q) > 1$, need originate from a seed. (f) Determine the minimal possible value $ T$ for a square $ (T\times T)$-seed resulting in a co-prime $ (p, q)$-balanced array, when $p,q$ are both prime. (g) Show that for any relatively prime $ p, q$ there must exist a co-prime $ (p, q)$-balanced array originating from a square $ (T\times T)$-seed, with no lesser $ (M\times N)$-seed available ($ M\leq T, N\leq T$ and $MN< T^2$). [i]Dan Schwarz[/i]

Let be a natural number $ n. $ Calculate $$ \sum_{k=1}^{n^2}\#\left\{ d\in\mathbb{N}| 1\le d\le k\le d^2\le n^2\wedge k\equiv 0\pmod d \right\} . $$ Here, $ \# $ means cardinal.

Given the rational numbers $r$, $q$, and $n$, such that $\displaystyle\frac1{r+qn}+\frac1{q+rn}=\frac1{r+q}$, prove that $\displaystyle\sqrt{\frac{n-3}{n+1}}$ is a rational number.

Find all positive integer $ m$ if there exists prime number $ p$ such that $ n^m\minus{}m$ can not be divided by $ p$ for any integer $ n$.

Let $x$ be the smallest positive integer that cannot be expressed in the form $\frac{2^a - 2^b}{2^c - 2^d}$, where $a$, $b$, $c$, $d$ are non-negative integers. Prove that $x$ is odd.

Let $\sqrt 3 = 1.b_1b_2b_3 \dots _{(2)}$ be the binary representation of $\sqrt 3$. Prove that for any positive integer $n$, at least one of the digits $b_n$, $b_{n+1}$, $\dots$, $b_{2n}$ equals $1$.

Find all positive integers $m$ such that there exists integers $x$ and $y$ that satisfies $$m \mid x^2+11y^2+2022.$$

Let $S=\{n|n-1,n,n+1$ can be expressed as the sum of the square of two positive integers.$\}$. Prove that if $n$ in $S$, $n^{2}$ is also in $S$.

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

Let $ABCD$ be an isosceles trapezoid with bases $AB=5$ and $CD=7$ and legs $BC=AD=2 \sqrt{10}.$ A circle $\omega$ with center $O$ passes through $A,B,C,$ and $D.$ Let $M$ be the midpoint of segment $CD,$ and ray $AM$ meet $\omega$ again at $E.$ Let $N$ be the midpoint of $BE$ and $P$ be the intersection of $BE$ with $CD.$ Let $Q$ be the intersection of ray $ON$ with ray $DC.$ There is a point $R$ on the circumcircle of $PNQ$ such that $\angle PRC = 45^\circ.$ The length of $DR$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. What is $m+n$? [i]Author: Ray Li[/i]

Prove that $a^9 - a$ is divisible by $6$ for all integers $a$.

Find all natural numbers with the property that, when the first digit is moved to the end, the resulting number is $\dfrac{7}{2}$ times the original one.

Let $d$ be a positive integer and let $\varepsilon$ be any positive real. Prove that for all sufficiently large primes $p$ with $\gcd(p-1,d) \neq 1$, there exists an positive integer less than $p^r$ which is not a $d$th power modulo $p$, where $r$ is defined by \[ \log r = \varepsilon - \frac{1}{\gcd(d,p-1)}. \][i]Proposed by Shashwat Kishore[/i]

Given a prime number $p$, a set is said to be $p$-good if the set contains exactly three elements $a, b, c$ and $a + b \equiv c \pmod{p}$. Find all prime number $p$ such that $\{ 1, 2, \cdots, p-1 \}$ can be partitioned into several $p$-good sets. [i]Proposed by capoouo[/i]

Find all square-free integers $d$ for which there exist positive integers $x, y$ and $n$ satisfying $x^2+dy^2=2^n$ Submitted by Kada Williams, Cambridge

Solve in prime numbers: $ \{\begin{array}{c}\ \ 2a - b + 7c = 1826 \ 3a + 5b + 7c = 2007 \end{array}$

Let $f(x) = 2^x + 3^x$. For how many integers $1 \leq n \leq 2020$ is $f(n)$ relatively prime to all of $f(0), f(1), \dots, f(n-1)$?

A positive integer $m$ is called a [i]beautiful [/i] integer if that there exists a positive integer $n$ such that $m = n^2+ n + 1$. Prove that there are infinitely many [i]beautiful [/i] integers with square factors, and the square factors of different beautiful integers are relative prime.

Guy has 17 cards. Each of them has an integer written on it (the numbers are not necessarily positive, and not necessarily different from each other). Guy noticed that for each card, the square of the number written on it equals the sum of the numbers on the 16 other cards. What are the numbers on Guy's cards? Find all of the options.

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).

Let $x, y$ be real numbers such that $x-y, x^2-y^2, x^3-y^3$ are all prime numbers. Prove that $x-y=3$. EDIT: Problem submitted by Leonel Castillo, Panama.

Determine all positive integers $N$ such that $$2^N-2N$$ is a perfect square. (Walther Janous)

For which integer \( h \), are there infinitely many positive integers \( n \) such that \( \lfloor \sqrt{h^2 + 1} \cdot n \rfloor \) is a perfect square? (Here \( \lfloor x \rfloor \) denotes the integer part of the real number \( x \)?