Found problems: 526
For every natural number $a$, consider the set $S(a)=\{a^n+a+1|n=2,3,\ldots\}$. Does there exist an infinite set $A\subset\mathbb N$ with the property that for any two distinct
elements $x,y\in A$, $x$ and $y$ are coprime and $S(x)\cap S(y)=\emptyset$?
Let $P$ be a non-constant polynomial with integer coefficients such that if $n$ is a perfect power, so is $P(n)$. Prove that $P(x) = x$ or $P$ is a perfect power of a polynomial with integer coefficients.
A perfect power is an integer $n^k$, where $n \in \mathbb Z$ and $k \ge 2$. A perfect power of a polynomial is a polynomial $P(x)^k$, where $P$ has integer coefficients and $k \ge 2$.
Show that there are infinitely many primes.
Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$
[list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good.
[*][b](b)[/b] Show that all 2010-good pairs are very good.[/list]
[i]Proposed by Okan Tekman, Turkey[/i]
Find the four smallest four-digit numbers that meet the following condition: by dividing by $2$, $3$, $4$, $5$ or $6$ the remainder is $ 1$.
Show that there exists a sequence of positive integers $x_1, x_2,…x_n,…$ that satisfies the following two conditions:
(i) Every positive integer appears exactly once,
(ii) For every $n=1,2,…$ the partial sum $x_1+x_2+…+x_n$ is divisible by $n^n$.
How many integers $n$ with $0\leq n < 840$ are there such that $840$ divides $n^8-n^4+n-1$?
$ \textbf{(A)}\ 1
\qquad\textbf{(B)}\ 2
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 6
\qquad\textbf{(E)}\ 8
$
Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.
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 $P=A_1A_2\cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, \ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
Hey,
This problem is from the VTRMC 2006.
3. Recall that the Fibonacci numbers $ F(n)$ are defined by $ F(0) \equal{} 0$, $ F(1) \equal{} 1$ and $ F(n) \equal{} F(n \minus{} 1) \plus{} F(n \minus{} 2)$ for $ n \geq 2$. Determine the last digit of $ F(2006)$ (e.g. the last digit of 2006 is 6).
As, I and a friend were working on this we noticed an interesting relationship when writing the Fibonacci numbers in "mod" notation.
Consider the following,
01 = 1 mod 10
01 = 1 mod 10
02 = 2 mod 10
03 = 3 mod 10
05 = 5 mod 10
08 = 6 mod 10
13 = 3 mod 10
21 = 1 mod 10
34 = 4 mod 10
55 = 5 mod 10
89 = 9 mod 10
Now, consider that between the first appearance and second apperance of $ 5 mod 10$, there is a difference of five terms. Following from this we see that the third appearance of $ 5 mod 10$ occurs at a difference 10 terms from the second appearance. Following this pattern we can create the following relationships.
$ F(55) \equal{} F(05) \plus{} 5({2}^{2})$
This is pretty much as far as we got, any ideas?
Prove that for every prime number $p$, there are infinitely many positive integers $n$ such that $p$ divides $2^n - n$.
Prove that for every positive integer $n$, there exist integers $a$ and $b$ such that $4a^2 + 9b^2 - 1$ is divisible by $n$.
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]
Let $T$ be the smallest positive integers which, when divided by $11,13,15$ leaves remainders in the sets {$7,8,9$}, {$1,2,3$}, {$4,5,6$} respectively. What is the sum of the squares of the digits of $T$ ?
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.
Call a quadruple of positive integers $(a, b, c, d)$ fruitful if there are infinitely many integers $m$ such that $\text{gcd} (am + b, cm + d) = 2019$. Find all possible values of $|ad-bc|$ over fruitful quadruples $(a, b, c, d)$.
Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that
$$f(x + f(y)) = f(x) + f(y)$$
for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.
Define the sequence $a_1, a_2, a_3, \ldots$ by $a_1 = 1$ and, for $n > 1$,
\[a_n = a_{\lfloor n/2 \rfloor} + a_{\lfloor n/3 \rfloor} + \ldots + a_{\lfloor n/n \rfloor} + 1.\]
Prove that there are infinitely many $n$ such that $a_n \equiv n \pmod{2^{2010}}$.
For the integer $n>1$, define $D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \}$. Prove that for any integer $k>1$, there exists pairwise distinct positive integers $n_1,n_2,\ldots,n_k$ such that $n_1,\ldots,n_k>1$ and $|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2$.
Xenia and Sergey play the following game. Xenia thinks of a positive integer $N$ not exceeding $5000$. Then she fixes $20$ distinct positive integers $a_1, a_2, \cdots, a_{20}$ such that, for each $k = 1,2,\cdots,20$, the numbers $N$ and $a_k$ are congruent modulo $k$. By a move, Sergey tells Xenia a set $S$ of positive integers not exceeding $20$, and she tells him back the set $\{a_k : k \in S\}$ without spelling out which number corresponds to which index. How many moves does Sergey need to determine for sure the number Xenia thought of?
[i]Sergey Kudrya, Russia[/i]
Prove that for every odd integer $n > 1$, there exist integers $a, b > 0$ such that, if we let $Q(x) = (x + a)^
2 + b$, then the following conditions hold:
$\bullet$ we have $\gcd(a, n) = gcd(b, n) = 1$;
$\bullet$ the number $Q(0)$ is divisible by $n$; and
$\bullet$ the numbers $Q(1), Q(2), Q(3), \dots$ each have a prime factor not dividing $n$.
For a nonnegative integer $n$ define $\operatorname{rad}(n)=1$ if $n=0$ or $n=1$, and $\operatorname{rad}(n)=p_1p_2\cdots p_k$ where $p_1<p_2<\cdots <p_k$ are all prime factors of $n$. Find all polynomials $f(x)$ with nonnegative integer coefficients such that $\operatorname{rad}(f(n))$ divides $\operatorname{rad}(f(n^{\operatorname{rad}(n)}))$ for every nonnegative integer $n$.
Prove that there exist monic polynomial $f(x) $ with degree of 6 and having integer coefficients such that
(1) For all integer $m$, $f(m) \ne 0$.
(2) For all positive odd integer $n$, there exist positive integer $k$ such that $f(k)$ is divided by $n$.
At ARML, Santa is asked to give rubber duckies to $2013$ students, one for each student. The students are conveniently numbered $1,2,\cdots,2013$, and for any integers $1 \le m < n \le 2013$, students $m$ and $n$ are friends if and only if $0 \le n-2m \le 1$.
Santa has only four different colors of duckies, but because he wants each student to feel special, he decides to give duckies of different colors to any two students who are either friends or who share a common friend. Let $N$ denote the number of ways in which he can select a color for each student. Find the remainder when $N$ is divided by $1000$.
[i]Proposed by Lewis Chen[/i]