Found problems: 526
Prove that there exist $C>0$, which satisfies the following conclusion:
For any infinite positive arithmetic integer sequence $a_1, a_2, a_3,\cdots$, if the greatest common divisor of $a_1$ and $a_2$ is squarefree, then there exists a positive integer $m\le C\cdot {a_2}^2$, such that $a_m$ is squarefree.
Note: A positive integer $N$ is squarefree if it is not divisible by any square number greater than $1$.
[i]Proposed by Qu Zhenhua[/i]
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
For how many permutations $\pi$ of $\{1,2,\ldots,9\}$ does there exist an integer $N$ such that \[N\equiv \pi(i)\pmod{i}\text{ for all integers }1\leq i\leq 9?\]
For positive integers $n$, let $f(n)$ denote the number of integers $1 \leq a \leq 130$ for which there exists some integer $b$ such that $a^b-n$ is divisible by $131$, and let $g(n)$ denote the sum of all such $a$. Find the remainder when$$\sum_{n = 1}^{130} [f(n) \cdot g(n)]$$is divided by $131$.
[i]Proposed by [b]ApraTrip[/b][/i]
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
Are there positive real numbers $a$ and $b$ such that $[an+b]$ is prime for all natural values of $n$ ?
$[x]$ denotes the integer part of the number $x$, the largest integer that does not exceed $x$.
Alice and Bob play the following game. They alternate selecting distinct nonzero digits (from $1$ to $9$) until they have chosen seven such digits, and then consider the resulting seven-digit number by concatenating the digits in the order selected, with the seventh digit appearing last (i.e. $\overline{A_1B_2A_3B_4A_6B_6A_7}$). Alice wins if and only if the resulting number is the last seven decimal digits of some perfect seventh power. Please determine which player has the winning strategy.
Consider a coordinate system in the plane, with the origin $O$. We call a lattice point $A{}$ [i]hidden[/i] if the open segment $OA$ contains at least one lattice point. Prove that for any positive integer $n$ there exists a square of side-length $n$ such that any lattice point lying in its interior or on its boundary is hidden.
Let $a_1,a_2,\dots,a_{2018}$ be a strictly increasing sequence of positive integers such that $$a_1+a_2+\cdots+a_{2018}=2018^{2018}.$$
What is the remainder when $a_1^3+a_2^3+\cdots+a_{2018}^3$ is divided by $6$?
$\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$
Does there exist a sequence of positive integers $a_1,a_2,...$ such that every positive integer occurs exactly once and that the number $\tau (na_{n+1}^n+(n+1)a_n^{n+1})$ is divisible by $n$ for all positive integer.
Here $\tau (n)$ denotes the number of positive divisor of $n$.
Let $S=2^3+3^4+5^4+7^4+\cdots+17497^4$ be the sum of the fourth powers of the first $2014$ prime numbers. Find the remainder when $S$ is divided by $240$.
A sequence $P=\left \{ a_{n} \right \}$ is called a $ \text{Permutation}$ of natural numbers (positive integers) if for any natural number $m,$ there exists a unique natural number $n$ such that $a_n=m.$
We also define $S_k(P)$ as:
$S_k(P)=a_{1}+a_{2}+\cdots +a_{k}$ (the sum of the first $k$ elements of the sequence).
Prove that there exists infinitely many distinct $ \text{Permutations}$ of natural numbers like $P_1,P_2, \cdots$ such that$:$
$$\forall k, \forall i<j: S_k(P_i)|S_k(P_j)$$
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Determine all integers $ k\ge 2$ such that for all pairs $ (m$, $ n)$ of different positive integers not greater than $ k$, the number $ n^{n\minus{}1}\minus{}m^{m\minus{}1}$ is not divisible by $ k$.
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Let $k$ be a nonzero natural number and $m$ an odd natural number . Prove that there exist a natural number $n$ such that the number $m^n+n^m$ has at least $k$ distinct prime factors.
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Find the remainder when $$\left \lfloor \frac{149^{151} + 151^{149}}{22499}\right \rfloor$$ is divided by $10^4$.
[i]Proposed by Vijay Srinivasan[/i]
Let $a$ and $b$ be distinct integers greater than $1$. Prove that there exists a positive integer $n$ such that $(a^n-1)(b^n-1)$ is not a perfect square.
[i]Proposed by Mongolia[/i]
Do there exist $1,000,000$ consecutive integers each of which contains a repeated prime factor?
Let $P(n)$ be a quadratic trinomial with integer coefficients. For each positive integer $n$, the number $P(n)$ has a proper divisor $d_n$, i.e., $1<d_n<P(n)$, such that the sequence $d_1,d_2,d_3,\ldots$ is increasing. Prove that either $P(n)$ is the product of two linear polynomials with integer coefficients or all the values of $P(n)$, for positive integers $n$, are divisible by the same integer $m>1$.
Find all positive integers $n$ that are quadratic residues modulo all primes greater than $n$.
Let $ b_1<b_2<b_3<\dots $ be the sequence of all natural numbers which are sum of squares of two natural numbers.
Prove that there exists infinite natural numbers like $m$ which $b_{m+1}-b_m=2015$ .
Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]