Found problems: 583
Define the sequence of integers $a_1, a_2, a_3, \ldots$ by $a_1 = 1$, and
\[ a_{n+1} = \left(n+1-\gcd(a_n,n) \right) \times a_n \]
for all integers $n \ge 1$.
Prove that $\frac{a_{n+1}}{a_n}=n$ if and only if $n$ is prime or $n=1$.
[i]Here $\gcd(s,t)$ denotes the greatest common divisor of $s$ and $t$.[/i]
Determine all sets $M$ of natural numbers such that for every two (not necessarily different) elements $a, b$ from $M$ , $$\frac{a + b}{gcd(a, b)}$$ lies in $M$.
In how many ways can you divide the set of eight numbers $\{2,3,\cdots,9\}$ into $4$ pairs such that no pair of numbers has $\text{gcd}$ equal to $2$?
There are $n$ natural numbers written on a blackboard, where $n\in\mathbb{N},\ n\geq 2$. During each step two chosen numbers $a,b$, having the property that none of them divides the other, are replaced by their greatest common divisor and least common multiple. Prove that after a number of steps, all the numbers on the blackboard cease modifying. Prove that the respective number of steps is at most $(n-1)!$.
Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?
$ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$
Find all integer solutions of the equation
\[x^2+y^2=(x-y)^3.\]
Compute gcd$(5^{2547} - 1, 5^{2004} - 1)$.
Can one find 4004 positive integers such that the sum of any 2003 of them is not divisible by 2003?
Determine all pairs of natural numbers $(x; n)$ that satisfy the equation
\[x^{3}+2x+1 = 2^{n}.\]
Let $ n$ and $ k$ be positive integers, $ n\geq k$. Prove that the greatest common divisor of the numbers $ \binom{n}{k},\binom{n\plus{}1}{k},\ldots,\binom{n\plus{}k}{k}$ is $ 1$.
Given $a_0 > 1$, the sequence $a_0, a_1, a_2, ...$ is such that for all $k > 0$, $a_k$ is the smallest integer greater than $a_{k-1}$ which is relatively prime to all the earlier terms in the sequence.
Find all $a_0$ for which all terms of the sequence are primes or prime powers.
Let $a_0=29$, $b_0=1$ and $$a_{n+1} = a_n+a_{n-1}\cdot b_n^{2019}, \qquad b_{n+1}=b_nb_{n-1}$$ for $n\geq 1$. Determine the smallest positive integer $k$ for which $29$ divides $\gcd(a_k, b_k-1)$ whenever $a_1,b_1$ are positive integers and $29$ does not divide $b_1$.
Find all solutions $(x, y) \in \mathbb Z^2$ of the equation
\[x^3 - y^3 = 2xy + 8.\]
A rectangle can be divided by parallel lines to its sides into 200 congruent squares, and also in 288 congruent squares. Prove that the rectangle can also be divided into 392 congruent squares.
Let $a=1111\dots1111$ and $b=1111\dots1111$ where $a$ has forty ones and $b$ has twelve ones. Determine the greatest common divisor of $a$ and $b$.
Let $\mathbb N$ be the set of positive integers. Let $f: \mathbb N \to \mathbb N$ be a function satisfying the following two conditions:
(a) $f(m)$ and $f(n)$ are relatively prime whenever $m$ and $n$ are relatively prime.
(b) $n \le f(n) \le n+2012$ for all $n$.
Prove that for any natural number $n$ and any prime $p$, if $p$ divides $f(n)$ then $p$ divides $n$.
$ a_1, a_2, \ldots, a_n$ are integers, not all equal. Prove that there exist infinitely many prime numbers $ p$ such that for some $ k$
\[ p\mid a_1^k \plus{} \dots \plus{} a_n^k.\]
Suppose that $a_0, a_1, \cdots $ and $b_0, b_1, \cdots$ are two sequences of positive integers such that $a_0, b_0 \ge 2$ and \[ a_{n+1} = \gcd{(a_n, b_n)} + 1, \qquad b_{n+1} = \operatorname{lcm}{(a_n, b_n)} - 1. \] Show that the sequence $a_n$ is eventually periodic; in other words, there exist integers $N \ge 0$ and $t > 0$ such that $a_{n+t} = a_n$ for all $n \ge N$.
Find all nonnegative integers $x,y,z$ such that $(x+1)^{y+1} + 1= (x+2)^{z+1}$.
For an integer $30 \le k \le 70$, let $M$ be the maximum possible value of \[ \frac{A}{\gcd(A,B)} \quad \text{where } A = \dbinom{100}{k} \text{ and } B = \dbinom{100}{k+3}. \] Find the remainder when $M$ is divided by $1000$.
[i]Based on a proposal by Michael Tang[/i]
Let $a$, $b$ be such integers that $gcd(a + n,b + n) > 1$ for every integer $n \geq 1$. Prove that $a = b$.
Two circles $\gamma_1, \gamma_2$ in a plane, with centers $A$ and $B$ respectively, intersect at $C$ and $D$. Suppose that the circumcircle of $ABC$ intersects $\gamma_1$ in $E$ and $\gamma_2$ in $F$, where the arc $EF$ not containing $C$ lies outside $\gamma_1$ and $\gamma_2$. Prove that this arc $EF$ is bisected by the line $CD$.
Let $n$ be an arbitrary positive integer.
(a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$.
(b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).
Suppose $\, q_{0}, \, q_{1}, \, q_{2}, \ldots \; \,$ is an infinite sequence of integers satisfying the following two conditions:
(i) $\, m-n \,$ divides $\, q_{m}-q_{n}\,$ for $\, m > n \geq 0,$
(ii) there is a polynomial $\, P \,$ such that $\, |q_{n}| < P(n) \,$ for all $\, n$
Prove that there is a polynomial $\, Q \,$ such that $\, q_{n}= Q(n) \,$ for all $\, n$.
Find all positive integers $n$ for which there exist two distinct numbers of $n$ digits, $\overline{a_1a_2\ldots a_n}$ and $\overline{b_1b_2\ldots b_n}$, such that the number of $2n$ digits $\overline{a_1a_2\ldots a_nb_1b_2\ldots b_n}$ is divisible by $\overline{b_1b_2\ldots b_na_1a_2\ldots a_n}$.