Found problems: 526
Given an integer $a>1$. Prove that there exists a sequence of positive integers
\[ n_1, n_2, n_3, \ldots \]
Such that
\[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.
Find all positive integers $n$ such that for any positive integer $a$ relatively prime to $n$, $2n^2 \mid a^n - 1$.
Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$.
[i]Proposed by Mohsen Jamali, Iran[/i]
Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.)
[i]Proposed by Carl Schildkraut, USA[/i]
For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$.
(i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$.
(ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$.
(The number $|P|$ is the size of set $P$)
[i]Dan Schwarz, Romania[/i]
The number $N$ is a two-digit number.
[list]
[*]When $N$ is divided by $9$, the remainder is $1$.
[*]When $N$ is divided by $10$, the remainder is $3$.
[/list]
What is the remainder when $N$ is divided by $11$?
$\textbf{(A) }0\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad \textbf{(E) }7$
Determine if there exists pairwise distinct positive integers $a_1$, $a_2$,$ ...$, $a_{101}$, $b_1$, $b_2$,$ ...$, $b_{101}$ satisfying the following property: for each non-empty subset $S$ of $\{1, 2, ..., 101\}$ the sum $\sum_{i \in S} a_i$ divides $100! + \sum_{i \in S} b_i$.
Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$.
[i]Proposed by Mohsen Jamali, Iran[/i]
Find the largest integer $N \in \{1, 2, \ldots , 2019 \}$ such that there exists a polynomial $P(x)$ with integer coefficients satisfying the following property: for each positive integer $k$, $P^k(0)$ is divisible by $2020$ if and only if $k$ is divisible by $N$. Here $P^k$ means $P$ applied $k$ times, so $P^1(0)=P(0), P^2(0)=P(P(0)),$ etc.
A palindrome in base $b$ is a positive integer whose base-$b$ digits read the same backwards and forwards; for example, $2002$ is a $4$-digit palindrome in base $10$. Note that $200$ is not a palindrome in base $10$, but it is a $3$-digit palindrome: $242$ in base $9$, and $404$ in base $7$. Prove that there is an integer which is a $3$-digit palindrome in base $b$ for at least $2002$ different values of $b$.
Given an integer $n>2$ and an integer $a$, if there exists an integer $d$ such that $n\mid a^d-1$ and $n\nmid a^{d-1}+\cdots+1$, we say [i]$a$ is $n-$separating[/i]. Given any n>2, let the [i]defect of $n$[/i] be defined as the number of integers $a$ such that $0<a<n$, $(a,n)=1$, and $a$ is not [i] $n-$separating[/i]. Determine all integers $n>2$ whose defect is equal to the smallest possible value.
Prove that there exists a positive integer $n$, such that the number $k^2+k+n$ does not have a prime divisor less than $2008$ for any integer $k$.
$n$ is a natural number. $d$ is the least natural number that for each $a$ that $gcd(a,n)=1$ we know $a^{d}\equiv1\pmod{n}$. Prove that there exist a natural number that $\mbox{ord}_{n}b=d$
Determine the last two digits of the number $2^5 + 2^{5^{2}} + 2^{5^{3}} +... + 2^{5^{1991}}$ , written in decimal notation.
a) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
\[g^n - n\quad\text{ and }\quad g^{n+1} - (n + 1).\]
b) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
\[g^n - n^2\quad\text{ and }g^{n+1} - (n + 1)^2.\]
[b]p1.[/b] Prove that $x = 2$ is the only real number satisfying $3^x + 4^x = 5^x$.
[b]p2.[/b] Show that $\sqrt{9 + 4\sqrt5} -\sqrt{9 - 4\sqrt5}$ is an integer.
[b]p3.[/b] Two players $A$ and $B$ play a game on a round table. Each time they take turn placing a round coin on the table. The coin has a uniform size, and this size is at least $10$ times smaller than the table size. They cannot place the coin on top of any part of other coins, and the whole coin must be on the table. If a player cannot place a coin, he loses. Suppose $A$ starts first. If both of them plan their moves wisely, there will be one person who will always win. Determine whether $A$ or $B$ will win, and then determine his winning strategy.
[b]p4.[/b] Suppose you are given $4$ pegs arranged in a square on a board. A “move” consists of picking up a peg, reflecting it through any other peg, and placing it down on the board. For how many integers $1 \le n \le 2013$ is it possible to arrange the $4$ pegs into a [i]larger [/i] square using exactly $n$ moves? Justify your answers.
[b]p5.[/b] Find smallest positive integer that has a remainder of $1$ when divided by $2$, a remainder of $2$ when divided by $3$, a remainder of $3$ when divided by $5$, and a remainder of $5$ when divided by $7$.
[b]p6.[/b] Find the value of $$\sum_{m|496,m>0} \frac{1}{m},$$
where $m|496$ means $496$ is divisible by $m$.
[b]p7.[/b] What is the value of
$${100 \choose 0}+{100 \choose 4}+{100 \choose 8}+ ... +{100 \choose 100}?$$
[b]p8.[/b] An $n$-term sequence $a_0, a_1, ...,a_n$ will be called [i]sweet [/i] if, for each $0 \le i \le n -1$, $a_i$ is the number of times that the number $i$ appears in the sequence. For example, $1, 2, 1,0$ is a sweet sequence with $4$ terms. Given that $a_0$, $a_1$, $...$, $a_{2013}$ is a sweet sequence, find the value of $a^2_0+ a^2_1+ ... + a^2_{2013}.$
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
[list=a]
[*]Prove that for every real number $t$ such that $0 < t < \tfrac{1}{2}$ there exists a positive integer $n$ with the following property: for every set $S$ of $n$ positive integers there exist two different elements $x$ and $y$ of $S$, and a non-negative integer $m$ (i.e. $m \ge 0 $), such that \[ |x-my|\leq ty.\]
[*]Determine whether for every real number $t$ such that $0 < t < \tfrac{1}{2} $ there exists an infinite set $S$ of positive integers such that \[|x-my| > ty\] for every pair of different elements $x$ and $y$ of $S$ and every positive integer $m$ (i.e. $m > 0$).
A teacher asks each of eleven pupils to write a positive integer with at most four digits, each on a separate yellow sticky note. Show that if all the numbers are different, the teacher can always submit two or more of the eleven stickers so that the average of the numbers on the selected notes are not an integer.
Prove that for every prime number $p$ there exist infinity many natural numbers $n$ so that they satisfy:
$2^{2^{2^{ \dots ^{2^n}}}} \equiv n^{2^{2^{\dots ^{2}}}} (mod p)$
Where in both sides $2$ appeared $1397$ times
Prove that there is positive integers $N$ such that the equation $$arctan(N)=\sum_{i=1}^{2020} a_i arctan(i),$$ does not hold for any integers $a_{i}.$
We know $\mathbb Z_{210} \cong \mathbb Z_2 \times \mathbb Z_3 \times \mathbb Z_5 \times \mathbb Z_7$.
Moreover,\begin{align*}
53 & \equiv 1 \pmod{2} \\
53 & \equiv 2 \pmod{3} \\
53 & \equiv 3 \pmod{5} \\
53 & \equiv 4 \pmod{7}.
\end{align*}
Let
\[ M = \left(
\begin{array}{ccc}
53 & 158 & 53 \\
23 & 93 & 53 \\
50 & 170 & 53
\end{array}
\right). \]
Based on the above, find $\overline{(M \mod{2})(M \mod{3})(M \mod{5})(M \mod{7})}$.
Determine all positive integers $n \ge 2$ that satisfy the following condition; For all integers $a, b$ relatively prime to $n$, \[a \equiv b \; \pmod{n}\Longleftrightarrow ab \equiv 1 \; \pmod{n}.\]
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 $a > 1$ be a positive integer. Prove that for some nonnegative integer $n$, the number $2^{2^n}+a$ is not prime.
[i]Proposed by Jack Gurev[/i]
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]