Found problems: 341
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$.
Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.
Find all positive integers $k$ for which the equation: $$ \text{lcm}(m,n)-\text{gcd}(m,n)=k(m-n)$$ has no solution in integers positive $(m,n)$ with $m\neq n$.
A set of positive integers is called [i]fragrant[/i] if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let $P(n)=n^2+n+1$. What is the least possible positive integer value of $b$ such that there exists a non-negative integer $a$ for which the set $$\{P(a+1),P(a+2),\ldots,P(a+b)\}$$ is fragrant?
The repeating decimal $2.0151515\ldots$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that
[list]
[*]$m = 1$ and $l = 2k$; or
[*]$l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$.
[/list]
Let $m,n$ be natural numbers and let $d = gcd(m,n)$. Let $x = 2^{m} -1$ and $y= 2^n +1$
(a) If $\frac{m}{d}$ is odd, prove that $gcd(x,y) = 1$
(b) If $\frac{m}{d}$ is even, Find $gcd(x,y)$
The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\]
a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$.
b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution.
c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.
Consider the sequence: $x_1=19,x_2=95,x_{n+2}=\text{lcm} (x_{n+1},x_n)+x_n$, for $n>1$, where $\text{lcm} (a,b)$ means the least common multiple of $a$ and $b$. Find the greatest common divisor of $x_{1995}$ and $x_{1996}$.
Find all positive integers $(a,b,c)$ such that
$$ab-c,\quad bc-a,\quad ca-b$$ are all powers of $2$.
[i]Proposed by Serbia[/i]
Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$.
Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$
[i]Proposed by Krit Boonsiriseth[/i]
Let $p$ be an odd prime and $S = \{1,2,3,\dots, p\}$
Assume that $U: S \rightarrow S$ is a bijection and $B$ is an integer such that $$B\cdot U(U(a)) - a \: \text{ is a multiple of} \: p \: \text{for all} \: a \in S$$
Show that $B^{\frac{p-1}{2}} -1$ is a multiple of $p$.
Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$
[i]Proposed by Krit Boonsiriseth[/i]
Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20.
[i]Proposed by Luxembourg[/i]
The sequences of natural numbers $p_n$ and $q_n$ are given such that
$$p_1 = 1,\ q_1 = 1,\ p_{n + 1} = 2q_n^2-p_n^2,\ q_{n + 1} = 2q_n^2+p_n^2 $$
Prove that $p_n$ and $q_m$ are coprime for any m and n.
Let $ n$ be a positive integer. Given an integer coefficient polynomial $ f(x)$, define its [i]signature modulo $ n$[/i] to be the (ordered) sequence $ f(1), \ldots , f(n)$ modulo $ n$. Of the $ n^n$ such $ n$-term sequences of integers modulo $ n$, how many are the signature of some polynomial $ f(x)$ if
a) $ n$ is a positive integer not divisible by the square of a prime.
b) $ n$ is a positive integer not divisible by the cube of a prime.
What is $10 \cdot \left(\tfrac{1}{2} + \tfrac{1}{5} + \tfrac{1}{10}\right)^{-1}?$
${ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ \frac{25}{2}\qquad\textbf{(D)}}\ \frac{170}{3}\qquad\textbf{(E)}\ 170$
Let $H = \{ \lfloor i\sqrt{2}\rfloor : i \in \mathbb Z_{>0}\} = \{1,2,4,5,7,\dots \}$ and let $n$ be a positive integer. Prove that there exists a constant $C$ such that, if $A\subseteq \{1,2,\dots, n\}$ satisfies $|A| \ge C\sqrt{n}$, then there exist $a,b\in A$ such that $a-b\in H$. (Here $\mathbb Z_{>0}$ is the set of positive integers, and $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z$.)
Determine the largest number of steps for $\gcd(k,76)$ to terminate over all choices of $0 < k < 76$, using the following algorithm for gcd. Give your answer in the form $(n,k)$ where $n$ is the maximal number of steps and $k$ is the $k$ which achieves this. If multiple $k$ work, submit the smallest one.
\begin{tabular}{l}
1: \textbf{FUNCTION} $\text{gcd}(a,b)$: \\
2: $\qquad$ \textbf{IF} $a = 0$ \textbf{RETURN} $b$ \\
3: $\qquad$ \textbf{ELSE RETURN} $\text{gcd}(b \bmod a,a)$
\end{tabular}
Let $ABC$ be a triangle with circumcircle $\Gamma$, circumcenter $O$, and orthocenter $H$. Assume that $AB\neq AC$ and that $\angle A \neq 90^{\circ}$. Let $M$ and $N$ be the midpoints of sides $AB$ and $AC$, respectively, and let $E$ and $F$ be the feet of the altitudes from $B$ and $C$ in $\triangle ABC$, respectively. Let $P$ be the intersection of line $MN$ with the tangent line to $\Gamma$ at $A$. Let $Q$ be the intersection point, other than $A$, of $\Gamma$ with the circumcircle of $\triangle AEF$. Let $R$ be the intersection of lines $AQ$ and $EF$. Prove that $PR\perp OH$.
[i]Proposed by Ray Li[/i]
Look at these fractions. At firs step we have $ \frac{0}{1}$ and $ \frac{1}{0}$, and at each step we write $ \frac{a\plus{}b}{c\plus{}d}$ between $ \frac{a}{b}$ and $ \frac{c}{d}$, and we do this forever
\[ \begin{array}{ccccccccccccccccccccccccc}\frac{0}{1}&&&&&&&&\frac{1}{0}\\ \frac{0}{1}&&&&\frac{1}{1}&&&&\frac{1}{0}\\ \frac{0}{1}&&\frac{1}{2}&&\frac{1}{1}&&\frac{2}{1}&&\frac{1}{0}\\ \frac{0}{1}&\frac{1}{3}&\frac{1}{2}&\frac{2}{3}&\frac{1}{1}&\frac{3}{2}&\frac{2}{1}&\frac{3}{1}&\frac{1}{0}\\ &&&&\dots\end{array}\]
a) Prove that each of these fractions is irreducible.
b) In the plane we have put infinitely many circles of diameter 1, over each integer on the real line, one circle. The inductively we put circles that each circle is tangent to two adjacent circles and real line, and we do this forever. Prove that points of tangency of these circles are exactly all the numbers in part a(except $ \frac{1}{0}$).
[img]http://i2.tinypic.com/4m8tmbq.png[/img]
c) Prove that in these two parts all of positive rational numbers appear.
If you don't understand the numbers, look at [url=http://upload.wikimedia.org/wikipedia/commons/2/21/Arabic_numerals-en.svg]here[/url].
Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.
Suppose that $m$ and $k$ are non-negative integers, and $p = 2^{2^m}+1$ is a prime number. Prove that
[b](a)[/b] $2^{2^{m+1}p^k} \equiv 1$ $(\text{mod } p^{k+1})$;
[b](b)[/b] $2^{m+1}p^k$ is the smallest positive integer $n$ satisfying the congruence equation $2^n \equiv 1$ $(\text{mod } p^{k+1})$.
Compute the greatest common divisor of $4^8 - 1$ and $8^{12} - 1$.