Found problems: 526
We choose random a unitary polynomial of degree $n$ and coefficients in the set $1,2,...,n!$. Prove that the probability for this polynomial to be special is between $0.71$ and $0.75$, where a polynomial $g$ is called special if for every $k>1$ in the sequence $f(1), f(2), f(3),...$ there are infinitely many numbers relatively prime with $k$.
Does there exist a positive integer $ n$ such that $ n$ has exactly 2000 prime divisors and $ n$ divides $ 2^n \plus{} 1$?
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
How many positive three-digit integers have a remainder of 2 when divided by 6, a remainder of 5 when divided by 9, and a remainder of 7 when divided by 11?
$\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad \textbf{(E) }5$
Prove that if $ n$ is an odd positive integer, then the last two digits of $ 2^{2n}(2^{2n\plus{}1}\minus{}1)$ in base $ 10$ are $ 28$.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $a,b$ be two integers and suppose that $n$ is a positive integer for which the set $\mathbb{Z} \backslash \{ax^n + by^n \mid x,y \in \mathbb{Z}\}$ is finite. Prove that $n=1$.
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $a, b, c, d$ be odd positive integers and pairwise coprime. For a positive integer $n$, let $$f(n) = \left[\frac{n}{a}
\right]+\left[\frac{n}{b}\right]+\left[\frac{n}{c}\right]+\left[\frac{n}{d}\right]$$ Prove that $$\sum_{n=1}^{abcd}(-1)^{f(n)}=1$$
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
For which positive integer couples $(k,n)$, the equality
$\Bigg|\Bigg\{{a \in \mathbb{Z}^+: 1\leq a\leq(nk)!, gcd \left(\binom{a}{k},n\right)=1}\Bigg\}\Bigg|=\frac{(nk)!}{6}$
holds?
A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.
Let $ L$ denote the set of all lattice points of the plane (points with integral coordinates). Show that for any three points $ A,B,C$ of $ L$ there is a fourth point $ D,$ different from $ A,B,C,$ such that the interiors of the segments $ AD,BD,CD$ contain no points of $ L.$ Is the statement true if one considers four points of $ L$ instead of three?
Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties:
(i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$;
(ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite.
Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic.
[i]Proposed by Ang Jie Jun, Singapore[/i]
A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.
For each positive integer $n$, denote by $\omega(n)$ the number of distinct prime divisors of $n$ (for example, $\omega(1)=0$ and $\omega(12)=2$). Find all polynomials $P(x)$ with integer coefficients, such that whenever $n$ is a positive integer satisfying $\omega(n)>2023^{2023}$, then $P(n)$ is also a positive integer with
\[\omega(n)\ge\omega(P(n)).\]
Greece (Minos Margaritis - Iasonas Prodromidis)
Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers.
One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins).
In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice.
[i]Nikolai Beluhov[/i]
Find all positive integers $k$ such that for every $n\in\mathbb N$, if there are $k$ factors (not necessarily distinct) of $n$ so that the sum of their squares is $n$, then there are $k$ factors (not necessarily distinct) of $n$ so that their sum is exactly $n$.
Find the least non-negative integer $n$ such that exists a non-negative integer $k$ such that the last 2012 decimal digits of $n^k$ are all $1$'s.
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
Let $b\ge 2$ be an integer. Call a positive integer $n$ $b$-[i]eautiful[/i] if it has exactly two digits when expressed in base $b$ and these two digits sum to $\sqrt{n}$. For example, $81$ is $13$-[i]eautiful[/i] because $81 = \underline{6} \ \underline{3}_{13} $ and $6 + 3 = \sqrt{81}$. Find the least integer $b\ge 2$ for which there are more than ten $b$-[i]eautiful[/i] integers.
Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property:
\[ n!\mid a^n \plus{} 1
\]
[i]Proposed by Carlos Caicedo, Colombia[/i]
Let $\mathbb{Z}$ denote the set of integers and $S \subset \mathbb{Z} $ be the set of integers that are at least $10^{100}$. Fix a positive integer $c$. Determine all functions $f: S \rightarrow \mathbb{Z} $ satisfying
$f(xy+c)=f(x)+f(y)$, for all $x,y \in S$
If $1<k_1<k_2<...<k_n$ and $a_1,a_2,...,a_n$ are integers such that for every integer $N,$ $k_i \mid N-a_i$ for some $1 \leq i \leq n,$ find the smallest possible value of $n.$