Found problems: 526
Find the sum of the $23$ smallest positive integers that are $4$ more than a multiple of $23$ and whose last two digits are $23.$
Let $n$ be an odd integer and $m=\phi(n)$ be the Euler's totient function. Call a set of residues $T=\{a_1, \cdots, a_k\} \pmod n$ to be [i]good[/i] if $\gcd(a_i, n) > 1$ $\forall i$, and $\gcd(a_i, a_j) = 1, \forall i \neq j$. Define the set $S_n$ consisting of the residues $$\sum_{i=1}^k a_i ^m\pmod{n}$$ over all possible residue sets $T=\{a_1,\cdots,a_k\}$ that is good. Determine $|S_n|$.
[i]Proposed by Anzo Teh Zhao Yang[/i]
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
A positive integer $N$ is [i]rioplatense[/i] if it satifies the following conditions:
1 -There exist $34$ consecutive integers such that its product is divisible by $N$, but none of them is divisible by $N$.
2 - There [b]not[/b] exist $30$ consecutive integers such that its product is divisible by $N$, but none of them is divisible by $N$.
Determine all rioplatense numbers.
For all integers $n\geq 1$ we define $x_{n+1}=x_1^2+x_2^2+\cdots +x_n^2$, where $x_1$ is a positive integer. Find the least $x_1$ such that 2006 divides $x_{2006}$.
[b]numbers $n^2+1$[/b]
Prove that there are infinitely many natural numbers of the form $n^2+1$ such that they don't have any divisor of the form $k^2+1$ except $1$ and themselves.
time allowed for this question was 45 minutes.
Prove that there exists a positive integer $n$ such that $n^6 + 31n^4 - 900\vdots 2009 \cdot 2010 \cdot 2011$.
(I. Losev, I. Voronovich)
Let $\mathbb{Z}[x]$ denote the set of single-variable polynomials in $x$ with integer coefficients. Find all functions $\theta : \mathbb{Z}[x] \to \mathbb{Z}[x]$ (i.e. functions taking polynomials to polynomials)
such that
[list]
[*] for any polynomials $p, q \in \mathbb{Z}[x]$, $\theta(p + q) = \theta(p) + \theta(q)$;
[*] for any polynomial $p \in \mathbb{Z}[x]$, $p$ has an integer root if and only if $\theta(p)$ does.
[/list]
[i]Carl Schildkraut[/i]
Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.
For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.
For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$.
[i]Proposed by J.P. Grossman, Canada[/i]
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 $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function.
[i]Proposed by James Rickards, Canada[/i]
Determine all non-constant polynomials $ f\in \mathbb{Z}[X]$ with the property that there exists $ k\in\mathbb{N}^*$ such that for any prime number $ p$, $ f(p)$ has at most $ k$ distinct prime divisors.
Show that for any two distinct odd primes $p, q$, there exists a positive integer $n$ such that $$\{d(n), d(n + 2) \} = \{p, q\}$$ where $d(n)$ is the smallest prime factor of $n$.
[i]Proposed By - ltf0501[/i]
Determine whether or not there exist positive integers $ a$ and $ b$ such that $ a$ does not divide $ b^n \minus{} n$ for all positive integers $ n$.
Let $ n$ and $ k$ be positive integers such as either $ n$ is odd or both $ n$ and $ k$ are even. Prove that exists integers $ a$ and $ b$ such as $ GCD(a,n) \equal{} GCD(b,n) \equal{} 1$ and $ k \equal{} a \plus{} b$
Let $n$ be a positive integer and $f(x)=a_mx^m+\ldots + a_1X+a_0$, with $m\ge 2$, a polynomial with integer coefficients such that:
a) $a_2,a_3\ldots a_m$ are divisible by all prime factors of $n$,
b) $a_1$ and $n$ are relatively prime.
Prove that for any positive integer $k$, there exists a positive integer $c$, such that $f(c)$ is divisible by $n^k$.
Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.
Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$.
[i]Proposed by Evan Chen[/i]
Find the number of ordered triples $(a,b,c)$ of integers satisfying $0\le a,b,c \le 1000$ for which \[a^3+b^3+c^3\equiv 3abc+1\pmod{1001}.\]
[i]Proposed by James Lin[/i]
For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?
Determine all integers $m\ge2$ for which there exists an integer $n\ge1$ with
$\gcd(m,n)=d$ and $\gcd(m,4n+1)=1$.
[i]Proposed by Gerhard Woeginger, Austria[/i]
Find all positive integers $n$ such that for any integer $k$ there exists an integer $a$ for which $a^3+a-k$ is divisible by $n$.
[i]Warut Suksompong, Thailand[/i]
Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.