Let $\left(1+\sqrt{2}\right)^{2012}=a+b\sqrt{2}$, where $a$ and $b$ are integers. The greatest common divisor of $b$ and $81$ is $\text{(A) }1\qquad\text{(B) }3\qquad\text{(C) }9\qquad\text{(D) }27\qquad\text{(E) }81$

Find the sum of the greatest common factor and the least common multiple of $12$ and $18$.

Suppose that $a$ and $b$ are two distinct positive real numbers such that $\lfloor na\rfloor$ divides $\lfloor nb\rfloor$ for any positive integer $n$. Prove that $a$ and $b$ are positive integers.

Determine all ordered triples of positive integers $(x, y, z)$ such that $\gcd(x+y, y+z, z+x) > \gcd(x, y, z)$.

Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is: \[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\] Find the least possible value of $n$.

We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions: $\bullet$ gcd $(a, b, c)=1$, $\bullet$ gcd $(a, b + c)>1$, $\bullet$ gcd $(b, c + a)>1$, $\bullet$ gcd $(c, a + b)>1$. a) Is it possible that $a + b + c = 2015$? b) Determine the minimum possible value that the sum $a+ b+ c$ can take.

Find all couples of natural numbers $(a,b)$ not relatively prime ($\gcd(a,b)\neq\ 1$) such that \[\gcd(a,b)+9\operatorname{lcm}[a,b]+9(a+b)=7ab.\]

Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

Prove that there exist a natural number $a$, for which 999 divides $2^{5n}+a.5^n$ for $\forall$ odd $n\in \mathbb{N}$ and find the smallest such $a$.

The sequence of integers an is given by $a_0 = 0, a_n = p(a_n-1)$, where $p(x)$ is a polynomial whose coefficients are all positive integers. Show that for any two positive integers $m, k$ with greatest common divisor $d$, the greatest common divisor of $a_m$ and $a_k$ is $a_d$.

Find all ordered pairs of integers $(a,b)$ such that $3^a + 7^b$ is a perfect square.

Determine the greatest common divisor of the numbers: $$5^5-5, 7^7-7, 9^9-9 ,..., 2017^{2017}-2017,$$

Prove that if a lattice triangle has no lattice points on its boundary in addition to its vertices, and one point in its interior, then this interior point is its center of gravity.

Does there exist positive integers $a_{1}<a_{2}<\cdots<a_{100}$ such that for $2 \le k \le 100$, the greatest common divisor of $a_{k-1}$ and $a_{k}$ is greater than the greatest common divisor of $a_{k}$ and $a_{k+1}$?

Let $ A$ be a subset of the set $ \{1, 2,\ldots,2006\}$, consisting of $ 1004$ elements. Prove that there exist $ 3$ distinct numbers $ a,b,c\in A$ such that $ gcd(a,b)$: a) divides $ c$ b) doesn't divide $ c$

Let $G$ be a graph on $n\geq 6$ vertices and every vertex is of degree at least 3. If $C_{1}, C_{2}, \dots, C_{k}$ are all the cycles in $G$, determine all possible values of $\gcd(|C_{1}|, |C_{2}|, \dots, |C_{k}|)$ where $|C|$ denotes the number of vertices in the cycle $C$.

Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.

$m$ is an integer satisfying $m \ge 2024$ , $p$ is the smallest prime factor of $m$ , for an arithmetic sequence $\{a_n\}$ of positive numbers with the common difference $m$ satisfying : for any integer $1 \le i \le \frac{p}{2} $ , there doesn’t exist an integer $x , y \le \max \{a_1 , m\}$ such that $a_i=xy$ Try to proof that there exists a positive real number $c$ such that for any $ 1\le i \le j \le n $ , $gcd(a_i , a_j ) = c \times gcd(i , j)$

For each positive integer $n$ , define $a_n = 20 + n^2$ and $d_n = gcd(a_n, a_{n+1})$. Find the set of all values that are taken by $d_n$ and show by examples that each of these values is attained.

Prove that if coefficients of the quadratic equation $ ax^2\plus{}bx\plus{}c\equal{}0$ are odd integers, then the roots of the equation cannot be rational numbers.

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.

Let $S$ be the set of all pairs $(a,b)$ of real numbers satisfying $1+a+a^2+a^3 = b^2(1+3a)$ and $1+2a+3a^2 = b^2 - \frac{5}{b}$. Find $A+B+C$, where \[ A = \prod_{(a,b) \in S} a , \quad B = \prod_{(a,b) \in S} b , \quad \text{and} \quad C = \sum_{(a,b) \in S} ab. \][i]Proposed by Evan Chen[/i]

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$

Charlotte writes the integers $1,2,3,\ldots,2025$ on the board. Charlotte has two operations available: the GCD operation and the LCM operation. [list] [*]The GCD operation consists of choosing two integers $a$ and $b$ written on the board, erasing them, and writing the integer $\operatorname{gcd}(a, b)$. [*]The LCM operation consists of choosing two integers $a$ and $b$ written on the board, erasing them, and writing the integer $\operatorname{lcm}(a, b)$. [/list] An integer $N$ is called a [i]winning number[/i] if there exists a sequence of operations such that, at the end, the only integer left on the board is $N$. Find all winning integers among $\{1,2,3,\ldots,2025\}$ and, for each of them, determine the minimum number of GCD operations Charlotte must use. [b]Note:[/b] The number $\operatorname{gcd}(a, b)$ denotes the [i]greatest common divisor[/i] of $a$ and $b$, while the number $\operatorname{lcm}(a, b)$ denotes the [i]least common multiple[/i] of $a$ and $b$.

If $p$ is a prime number and $a>1$ is a natural number , then show that the greatest common divisor of the two numbers $a-1$ and $\frac{a^p-1}{a-1}$ is either $1$ or $p$ .