Found problems: 238
Edges of a planar graph $G$ are colored either with blue or red. Prove that there is a vertex like $v$ such that when we go around $v$ through a complete cycle, edges with the endpoint at $v$ change their color at most two times.
Clarifications for complete cycle:
If all the edges with one endpoint at $v$ are $(v,u_1),(v,u_2),\ldots,(v,u_k)$ such that $u_1,u_2,\ldots,u_k$ are clockwise with respect to $v$ then in the sequence of $(v,u_1),(v,u_2),\ldots,(v,u_k),(v,u_1)$ there are at most two $j$ such that colours of $(v,u_j),(v,u_{j+1})$ ($j \mod k$) differ.
Prove that for every positive integer $n$, there exists a polynomial with integer coefficients whose values at points $1,2,\dots,n$ are pairwise different powers of $2$.
Given a prime number \( p \geq 3 \) and a positive integer \( m \), find the smallest positive integer \( n \) with the following property: for every positive integer \( a \), which is not divisible by \( p \), the sum of the natural divisors of \( a^n \) greater than 1 is divisible by \( p^m \).
Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?
Let $F$ be the field of $p^2$ elements, where $p$ is an odd prime. Suppose $S$ is a set of $(p^2-1)/2$ distinct nonzero elements of $F$ with the property that for each $a\neq 0$ in $F$, exactly one of $a$ and $-a$ is in $S$. Let $N$ be the number of elements in the intersection $S \cap \{2a: a \in S\}$. Prove that $N$ is even.
Find the number of integers $a$ with $1\le a\le 2012$ for which there exist nonnegative integers $x,y,z$ satisfying the equation
\[x^2(x^2+2z) - y^2(y^2+2z)=a.\]
[i]Ray Li.[/i]
[hide="Clarifications"][list=1][*]$x,y,z$ are not necessarily distinct.[/list][/hide]
Real number $C > 1$ is given. Sequence of positive real numbers $a_1, a_2, a_3, \ldots$, in which $a_1=1$ and $a_2=2$, satisfy the conditions
\[a_{mn}=a_ma_n, \] \[a_{m+n} \leq C(a_m + a_n),\]
for $m, n = 1, 2, 3, \ldots$. Prove that $a_n = n$ for $n=1, 2, 3, \ldots$.
Consider the triangular array of numbers with $0,1,2,3,...$ along the sides and interior numbers obtained by adding the two adjacent numbers in the previous row. Rows $1$ through $6$ are shown.
\begin{tabular}{ccccccccccc} & & & & & 0 & & & & & \\ & & & & 1 & & 1 & & & & \\ & & & 2 & & 2 & & 2 & & & \\ & & 3 & & 4 & & 4 & & 3 & & \\ & 4 & & 7 & & 8 & & 7 & & 4 & \\ 5 & & 11 & & 15 & & 15 & & 11 & & 5 \end{tabular}
Let $f(n)$ denote the sum of the numbers in row $n$. What is the remainder when $f(100)$ is divided by $100$?
$\textbf{(A)}\ 12\qquad
\textbf{(B)}\ 30 \qquad
\textbf{(C)}\ 50 \qquad
\textbf{(D)}\ 62 \qquad
\textbf{(E)}\ 74$
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[2, \; 2^{2}, \; 2^{2^{2}}, \; 2^{2^{2^{2}}}, \cdots \pmod{n}\] is eventually constant.
Find all real functions $f$ definited on positive integers and satisying:
(a) $f(x+22)=f(x)$,
(b) $f\left(x^{2}y\right)=\left(f(x)\right)^{2}f(y)$
for all positive integers $x$ and $y$.
Let $f$ be a function such that $f(x)+f(x+1)=2^x$ and $f(0)=2010$. Find the last two digits of $f(2010)$.
A sequence $a_1,a_2,\dots$ satisfy
$$
\sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10},
$$
for every $n\in\mathbb{N}$.
Let $c$ be a positive integer. Prove that, for every positive integer $n$,
$$
\frac{c^{a_n}-c^{a_{n-1}}}{n}
$$
is an integer.
For all positive integers $n$, show that there exists a positive integer $m$ such that $n$ divides $2^{m} + m$.
[i]Proposed by Juhan Aru, Estonia[/i]
What is the smallest positive integer $t$ such that there exist integers $x_1,x_2,\ldots,x_t$ with \[x^3_1+x^3_2+\,\ldots\,+x^3_t=2002^{2002}\,?\]
Let $a$ and $n$ be positive integers such that the greatest common divisor of $a$ and $n!$ is $1$. Prove that $n!$ divides $a^{n!}-1$.
Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?
Find all solution $(p,r)$ of the "Pythagorean-Euler Theorem" $$p^p+(p+1)^p+\cdots+(p+r)^p=(p+r+1)^p$$Where $p$ is a prime and $r$ is a positive integer.
[i]Proposed by Li4 and Untro368[/i]
Let $R$ be the set of all possible remainders when a number of the form $2^n$, $n$ a nonnegative integer, is divided by $1000$. Let $S$ be the sum of all elements in $R$. Find the remainder when $S$ is divided by $1000$.
There are finitely many primes dividing the numbers $\{ a \cdot b^n + c\cdot d^n : n=1, 2, 3,... \}$ where $a, b, c, d$ are positive integers. Prove that $b=d$.
Find all pairs of natural numbers $(m,n)$, for which $m\mid 2^{\varphi(n)} +1$ and $n\mid 2^{\varphi (m)} +1$.
Given a (fixed) positive integer $N$, solve the functional equation
\[f \colon \mathbb{Z} \to \mathbb{R}, \ f(2k) = 2f(k) \textrm{ and } f(N-k) = f(k), \ \textrm{for all } k \in \mathbb{Z}.\]
[i](Dan Schwarz)[/i]
Prove that for each positive integer $a$ there exists such an integer $b>a$, for which $1+2^a+3^a$ divides $1+2^b+3^b$.
Let $a(n)$ be the sequence defined by $a(1)=2$ and $a(n+1)=(a(n))^{n+1}-1$ for each integer $n\geq 1$. Suppose that $p>2$ is a prime and $k$ is a positive integer. Prove that some term of the sequence $a(n)$ is divisible by $p^k$.
[i]Proposed by John Berman[/i]
For all positive integers $n$, show that there exists a positive integer $m$ such that $n$ divides $2^{m} + m$.
[i]Proposed by Juhan Aru, Estonia[/i]
Prove that there are infinitely many positive integers $n$ such that $2^{2^n+1}+1$ is divisible by $n$ but $2^n+1$ is not.
[i](Russia) Valery Senderov[/i]