For a prime $ p$ and a given integer $ n$ let $ \nu_p(n)$ denote the exponent of $ p$ in the prime factorisation of $ n!$. Given $ d \in \mathbb{N}$ and $ \{p_1,p_2,\ldots,p_k\}$ a set of $ k$ primes, show that there are infinitely many positive integers $ n$ such that $ d\mid \nu_{p_i}(n)$ for all $ 1 \leq i \leq k$. [i]Author: Tejaswi Navilarekkallu, India[/i]

We will say that a positive integer is [i]lucky [/i ]if the sum of its digits is divisible by $31$. What is the maximum possible difference between two consecutive [i]lucky [/i ] numbers?

Find all the pairs of positive integers $(m,n)$ such that the numbers $A=n^2+2mn+3m^2+3n$, $B=2n^2+3mn+m^2$, $C=3n^2+mn+2m^2$ are consecutive in some order.

What is the smallest positive integer with $24$ positive divisors?

If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.

Let $n$ be a positive integer. Show that $${2n+1 \choose 1} -{2n+1 \choose 3}2008 + {2n+1 \choose 5}2008^2- ...+(-1)^{n}{2n+1 \choose 2n+1}2008^n $$ is not divisible by $19$.

find all primes $p$, for which exist natural numbers, such that $p=m^2+n^2$ and $p|(m^3+n^3-4)$.

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

Show that, for every positive integer $x$, there is a positive integer $y\in \{2, 5, 13\}$ such that $xy - 1$ is not a perfect square.

Prove that there exists a positive integer $n$, such that the remainder of $3^n$ when divided by $2^n$ is greater than $10^{2021} $.

Prove that the number $1\underbrace{\hbox{0...0}}_{\hbox{49}}5\underbrace{\hbox{0...0}}_{\hbox{99}}1$ is not the cube of any integer.

A frog starts at $0$ on a number line and plays a game. On each turn the frog chooses at random to jump $1$ or $2$ integers to the right or left. It stops moving if it lands on a nonpositive number or a number on which it has already landed. If the expected number of times it will jump is $\tfrac{p}{q}$ for relatively prime positive integers $p$ and $q$, find $p+q$. [i]Proposed by Michael Kural[/i]

Let $p\ge 5$ be a prime number. Prove that there exist positive integers $m$ and $n$ with $m+n\le \frac{p+1}{2}$ for which $p$ divides $2^n\cdot 3^m-1.$

Find all positive integers $a, b, c$ such that $ab + 1$, $bc + 1$, and $ca + 1$ are all equal to factorials of some positive integers. Proposed by [i]Nikola Velov, Macedonia[/i]

Given a positive integer $n,$ let $s(n)$ denote the sum of the digits of $n.$ Compute the largest positive integer $n$ such that $n = s(n)^2 + 2s(n) - 2.$

For any number $x$, let $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. A sequence $a_1,a_2,\cdots$ is given, where \[a_n=\left\lfloor{\sqrt{2n}+\dfrac{1}{2}}\right\rfloor.\] How many values of $k$ are there such that $a_k=2010$?

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

is there a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $i) \exists n\in \mathbb{N}:f(n)\neq n$ $ii)$ the number of divisors of $m$ is $f(n)$ if and only if the number of divisors of $f(m)$ is $n$

$9.3$ A natural number is called square-free, if it is not divisible by the square of any prime number. For a natural number $a$, we consider the number $f(a) = a^{a+1} + 1$. Prove that: a) if $a$ is even, then $f(a)$ is not square-free b) there exist infinitely many odd $a$ for which $f(a)$ is not square-free $9.4$ We will call a generalized $2n$-parallelogram a convex polygon with $2n$ sides, so that, traversed consecutively, the $k$th side is parallel and equal to the $(n+k)$th side for $k=1, 2, ... , n$. In a rectangular coordinate system, a generalized parallelogram is given with $50$ vertices, each with integer coordinates. Prove that its area is at least $300$.

Show that the number $1989$ as well as each of its powers $1989^n$ ($n \in N$), can be expressed as a sum of two positive squares in at least two ways.

What percent of the numbers $1, 2, 3, ... 1000$ are divisible by exactly one of the numbers $4$ and $5?$

Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]

Show that there are infinitely many positive integers $n$ such that the number of distinct odd prime factors of $n(n + 3)$ is a multiple of $3$. (For instance, $180 = 2^2 \cdot 3^2 \cdot 5$ has two distinct odd prime factors and $840 = 2^3 \cdot 3 \cdot 5 \cdot 7$ has three.)

Let $T$ be a non-empty finite subset of positive integers $\ge 1$. A subset $S$ of $T$ is called [b]good [/b] if for every integer $t\in T$ there exists an $s$ in $S$ such that $gcd(t,s) >1$. Let \[A={(X,Y)\mid X\subseteq T,Y\subseteq T,gcd(x,y)=1 \text{for all} x\in X, y\in Y}\] Prove that : $a)$ If $X_0$ is not [b]good[/b] then the number of pairs $(X_0,Y)$ in $A$ is [b]even[/b]. $b)$ the number of good subsets of $T$ is [b]odd[/b].

Let $a$, $b$ and $n$ be positive integers, satisfying that $bn$ divides $an-a+1$. Let $\alpha=a/b$. Prove that, when the numbers $\lfloor\alpha\rfloor,\lfloor2\alpha\rfloor,\dots,\lfloor(n-1)\alpha\rfloor$ are divided by $n$, the residues are $1,2,\dots,n-1$, in some order.