Let \( \varphi \) be the Euler's totient function. 1. For any given integer \( a > 1 \), does there exist \( l \in \mathbb{N}_+ \) such that for any \( k \in \mathbb{N}_+ \), \( l \mid k \) and \( a^2 \nmid l \), \( \frac{\varphi(k)}{\varphi(l)} \) is a non-negative power of \( a \)? 2. For integer \( x > a \), are there integers \( k_1 \) and \( k_2 \) satisfying: \[ \varphi(k_i) \in \left ( \frac{x}{a} ,x \right ], i = 1,2; \quad \varphi(k_1) \neq \varphi(k_2). \] And these two different \( k_i \) correspond to the same \( l_1 \) and \( l_2 \) as described in (1), yet \( \varphi(l_1) = \varphi(l_2) \). 3. Define \( \#E \) as the number of elements in set \( E \). For integer \( x > a \), let \( V(x) = \#\{v \in \mathbb{N}_+ \mid v = \varphi(k) \leq x\} \) and \( W(x) = \#\{w \in \mathbb{N}_+ \mid w = \varphi(l) \leq x, a^2 \mid l\} \). Compare \( V\left( \frac{x}{a} \right) \) with \( W(x) \).

We call a sequence of $m$ consecutive integers a [i]friendly[/i] sequence if its first term is divisible by $1$, the second by $2$, ..., the $(m-1)^{th}$ by $m-1$, and in addition, the last term is divisible by $m^2$ Does a friendly sequence exist for (a) $m=20$ and (b) $m=11$?

For $ k>0$, let $ I_k\equal{}10\ldots 064$, where there are $ k$ zeros between the $ 1$ and the $ 6$. Let $ N(k)$ be the number of factors of $ 2$ in the prime factorization of $ I_k$. What is the maximum value of $ N(k)$? $ \textbf{(A)}\ 6\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 8\qquad \textbf{(D)}\ 9\qquad \textbf{(E)}\ 10$

Suppose in a given collection of $2016$ integer, the sum of any $1008$ integers is positive. Show that sum of all $2016$ integers is positive.

For each positive integer $n$, let $S(n)$ be the sum of the digits of $n$. Determines the smallest positive integer $a$ such that there are infinite positive integers $n$ for which you have $S (n) -S (n + a) = 2018$.

Let $n$ be a positive integer such that $24\mid n+1$. Prove that the sum of the positive divisors of $n$ is divisble by 24.

For positive integer $n$, prove that at least one of the numbers $$A=2n-1 , B=5n-1, C=13n-1$$ is not perfect square

A circular track with diameter $500$ is externally tangent at a point A to a second circular track with diameter $1700.$ Two runners start at point A at the same time and run at the same speed. The first runner runs clockwise along the smaller track while the second runner runs clockwise along the larger track. There is a first time after they begin running when their two positions are collinear with the point A. At that time each runner will have run a distance of $\frac{m\pi}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n. $

Find all ordered triplets $(p,q,r)$ of positive integers such that $p$ and $q$ are two (not necessarily distinct) primes, $r$ is even, and \[p^3+q^2=4r^2+45r+103.\]

Given that the base-$17$ integer $\overline{8323a02421_{17}}$ (where a is a base-$17$ digit) is divisible by $\overline{16_{10}}$, find $a$. Express your answer in base $10$. [i]Proposed by Jonathan Liu[/i]

For a positive integer $n$ write down all its positive divisors in increasing order: $1=d_1<d_2<\ldots<d_k=n$. Find all positive integers $n$ divisible by $2019$ such that $n=d_{19}\cdot d_{20}$. [i](I. Gorodnin)[/i]

Show that \[(-1)^{\frac{p-1}{2}}{p-1 \choose{\frac{p-1}{2}}}\equiv 4^{p-1}\pmod{p^{3}}\] for all prime numbers $p$ with $p \ge 5$.

Let $n$ be a natural number. Prove that, \[ \left\lfloor \frac{n}{1} \right\rfloor+ \left\lfloor \frac{n}{2} \right\rfloor + \cdots + \left\lfloor \frac{n}{n} \right\rfloor + \left\lfloor \sqrt{n} \right\rfloor \] is even.

Tiham is trying to find [b]6[/b] digit positive integers$ PQRSTU$ (where $PQRSTU $are not necessarily distinct). But he only wants the numbers where the sum of the [b]3[/b] digit number$ PQR$, and the [b]3[/b] digit number $STU$ is divisible by [b]37[/b]. How many such numbers Tiham can find?

[b]a)[/b] Find an example of an infinite list of numbers of the form $a + n \cdot d$, with $n \geqslant 0$, where $a$ and $d$ are positive integers, such that no number in the list is equal to the $k$-th power of an integer, for all $k = 2, 3, 4, \dots$ [b]b)[/b] Find an example of an infinite list of numbers of the form $a + n \cdot d$, with $n \geqslant 0$, where $a$ and $d$ are positive integers, such that no number in the list is equal to the square of an integer, but the list contains infinitely many numbers that are equal to the cubes of positive integers.

Determine all integer $n > 1$ such that \[\gcd \left( n, \dfrac{n-m}{\gcd(n,m)} \right) = 1\] for all integer $1 \le m < n$.

$18.$ A subset $B$ of the set of first $100$ positive integers has the property that no two elements of $B$ sum to $125.$ What is the maximum possible number of elements in $B ?$

Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.

Find the last three digits in the product $1 \cdot 3\cdot 5\cdot 7 \cdot . . . \cdot 2009 \cdot 2011$.

Find the exponent of $37$ in the representation of the number $111...... 11$ with $3\cdot 37^{2000}$ digits equals to $1$, as product of prime powers

Let $A$ be a set of natural numbers, for which for $\forall n\in \mathbb{N}$ exactly one of the numbers $n$, $2n$, and $3n$ is an element of $A$. If $2\in A$, show whether $13824\in A$.

Find the highest power of $2$ that divides exactly into $1996!=1\times2\times\cdots\times1996$.

Are there infinite increasing sequence of natural numbers, such that sum of every 2 different numbers are relatively prime with sum of every 3 different numbers?

Every non-negative integer is coloured white or red, so that: • there are at least a white number and a red number; • the sum of a white number and a red number is white; • the product of a white number and a red number is red. Prove that the product of two red numbers is always a red number, and the sum of two red numbers is always a red number.

Prove that there exists a $2021$-digit positive integer $\overline{a_1a_2\ldots a_{2021}}$, with all its digits being non-zero, such that for every $1 \leq n \leq 2020$ the following equality holds $$\overline{a_1a_2\ldots a_n} \cdot \overline{a_{n+1}a_{n+2}\ldots a_{2021}}=\overline{a_1a_2\ldots a_{2021-n}} \cdot \overline{a_{2022-n}a_{2023-n}\ldots a_{2021}}$$ and all four numbers in the equality are pairwise different.