Let $a$, $b$ be such integers that $gcd(a + n,b + n) > 1$ for every integer $n \geq 1$. Prove that $a = b$.

We place $8$ distinct integers in the vertices of a cube and then write the greatest common divisor of each pair of adjacent vertices on the edge connecting them. Let $E$ be the sum of the numbers on the edges and $V$ the sum of the numbers on the vertices. a) Prove that $\frac23E\le V$. b) Can $E=V$?

For a positive integer number $n$ we denote $d(n)$ as the greatest common divisor of the binomial coefficients $\dbinom{n+1}{n} , \dbinom{n+2}{n} ,..., \dbinom{2n}{n}$. Find all possible values of $d(n)$

Determine all integer $n > 1$ such that \[\gcd \left( n, \dfrac{n-m}{\gcd(n,m)} \right) = 1\] for all integer $1 \le m < n$.

Determine the number of ordered pairs of positive integers $(m,n)$ with $1\leq m\leq 100$ and $1\leq n\leq 100$ such that \[ \gcd(m+1,n+1) = 10\gcd(m,n). \]

Let $a$ be the smallest and $A$ the largest of $n$ distinct positive integers. Prove that the least common multiple of these numbers is greater than or equal to $n a$ and that the greatest common divisor is less than or equal to $\frac{A}{n}$

Let $h(t)$ and $f(t)$ be polynomials such that $h(t)=t^2$ and $f_n(t)=h(h(h(h(h...h(t))))))-1$ where $h(t)$ occurs $n$ times. Prove that $f_n(t)$ is a factor of $f_N(t)$ whenever $n$ is a factor of $N$

If $p$ is a prime and $n$ an integer such that $1<n \le p$, then \[\phi \left( \sum_{k=0}^{p-1}n^{k}\right) \equiv 0 \; \pmod{p}.\]

Nadya has $2022$ cards, each with a number one or seven written on it. It is known that there are both cards.Nadya looked at all possible $2022$-digit numbers that can be composed from all these cards. What is the largest value that can take the greatest common divisor of all these numbers?

Let the positive integers $ a,b,c$ chosen such that the quotients $ \frac{bc}{b\plus{}c},$ $ \frac{ca}{c\plus{}a}$ and $ \frac{ab}{a\plus{}b}$ are integers. Prove that $ a,b,c$ have a common divisor greater than 1.

[asy] /*Using regular asymptote, this diagram would take 30 min to make. Using cse5, this takes 5 minutes. Conclusion? CSE5 IS THE BEST PACKAGE EVER CREATED!!!!*/ size(100); import cse5; pathpen=black; anglefontpen=black; pointpen=black; anglepen=black; dotfactor=3; pair A=(0,0),B=(0.5,0.5*sqrt(3)),C=(3,0),D=(1.7,0),EE; EE=(B+C)/2; D(MP("$A$",A,W)--MP("$B$",B,N)--MP("$C$",C,E)--cycle); D(MP("$E$",EE,N)--MP("$D$",D,S)); D(D);D(EE); MA("80^\circ",8,D,EE,C,0.1); MA("20^\circ",8,EE,C,D,0.3,2,shift(1,3)*C); draw(arc(shift(-0.1,0.05)*C,0.25,100,180),arrow =ArcArrow()); MA("100^\circ",8,A,B,C,0.1,0); MA("60^\circ",8,C,A,B,0.1,0); //Credit to TheMaskedMagician for the diagram [/asy] In $\triangle ABC$, $E$ is the midpoint of side $BC$ and $D$ is on side $AC$. If the length of $AC$ is $1$ and $\measuredangle BAC = 60^\circ$, $\measuredangle ABC = 100^\circ$, $\measuredangle ACB = 20^\circ$ and $\measuredangle DEC = 80^\circ$, then the area of $\triangle ABC$ plus twice the area of $\triangle CDE$ equals $\textbf{(A) }\frac{1}{4}\cos 10^\circ\qquad\textbf{(B) }\frac{\sqrt{3}}{8}\qquad\textbf{(C) }\frac{1}{4}\cos 40^\circ\qquad\textbf{(D) }\frac{1}{4}\cos 50^\circ\qquad\textbf{(E) }\frac{1}{8}$

Suppose $S$ is the set of all positive integers. For $a,b \in S$, define \[a * b=\frac{\text{lcm}[a,b]}{\text{gcd}(a,b)}\] For example $8*12=6$. Show that [b]exactly two[/b] of the following three properties are satisfied: (i) If $a,b \in S$, then $a*b \in S$. (ii) $(a*b)*c=a*(b*c)$ for all $a,b,c \in S$. (iii) There exists an element $i \in S$ such that $a *i =a$ for all $a \in S$.

Determine if there is a set $S$ of 2011 positive integers so that for every pair $m,n$ of distinct elements of $S$, $|m-n|=(m,n)$. Here $(m,n)$ denotes the greatest common divisor of $m$ and $n$.

How many ordered pairs $(a, b)$ of positive integers satisfy the equation $$a\cdot b + 63 = 20\cdot \text{lcm}(a, b) + 12\cdot\text{gcd}(a,b),$$ where $\text{gcd}(a,b)$ denotes the greatest common divisor of $a$ and $b$, and $\text{lcm}(a,b)$ denotes their least common multiple? $\textbf{(A)}\ 0\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 8$

How many positive integers $n$ are there such that $n$ is a multiple of $5$, and the least common multiple of $5!$ and $n$ equals $5$ times the greatest common divisor of $10!$ and $n?$ $\textbf{(A) } 12 \qquad \textbf{(B) } 24 \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 48 \qquad \textbf{(E) } 72$

For $m$ and $n$ positive integers that are prime to each other, determine the possible values ​​of $$\gcd (5^m + 7^m, 5^n + 7^n)$$

Let $n$ be a positive integer. Prove that there exist polynomials$f(x)$and $g(x$) with integer coefficients such that \[f(x)\left(x + 1 \right)^{2^n}+ g(x) \left(x^{2^n}+ 1 \right) = 2.\]

(a) Find all triples $(x,y,z)$ of positive integers such that $xy \equiv 2 (\bmod{z})$ , $yz \equiv 2 (\bmod{x})$ and $zx \equiv 2 (\bmod{y} )$ (b) Let $n \geq 1$ be an integer. Give an algoritm to determine all triples $(x,y,z)$ such that '2' in part (a) is replaced by 'n' in all three congruences.

a) If $K$ is a finite extension of the field $F$ and $K=F(\alpha,\beta)$ show that $[K: F]\leq [F(\alpha): F][F(\beta): F]$ b) If $gcd([F(\alpha): F],[F(\beta): F])=1$ then does the above inequality always become equality? c) By giving an example show that if $gcd([F(\alpha): F],[F(\beta): F])\neq 1$ then equality might happen.

Let $a, b$ and $c$ be natural numbers. Determine the smallest value that the following expression can take: $$\frac{a}{gcd\,\,(a + b, a - c)} + \frac{b}{gcd\,\,(b + c, b - a)} + \frac{c}{gcd\,\,(c + a, c - b)}.$$ . Remark: $gcd \,\, (6, 0) = 6$ and $gcd\,\,(3, -6) = 3$.

Let $T$ be a non-empty finite subset of positive integers $\ge 1$. A subset $S$ of $T$ is called [b]good [/b] if for every integer $t\in T$ there exists an $s$ in $S$ such that $gcd(t,s) >1$. Let \[A={(X,Y)\mid X\subseteq T,Y\subseteq T,gcd(x,y)=1 \text{for all} x\in X, y\in Y}\] Prove that : $a)$ If $X_0$ is not [b]good[/b] then the number of pairs $(X_0,Y)$ in $A$ is [b]even[/b]. $b)$ the number of good subsets of $T$ is [b]odd[/b].

Let $k,l$ be two given integers. Prove that there exist infinite many integers $m\ge k$ such that $\gcd\left(\binom{m}{k},l\right)=1$.

Find all pairs $(a, b)$ of positive integers such that \[ 3^a = 2b^2 + 1. \]

For each nonnegative integer $n$ we define $A_n = 2^{3n}+3^{6n+2}+5^{6n+2}$. Find the greatest common divisor of the numbers $A_0,A_1,\ldots, A_{1999}$. [i]Romania[/i]

Find all triples $(a,b,c)$ such that $a,b,c$ are integers in the set $\{2000,2001,\ldots,3000\}$ satisfying $a^2+b^2=c^2$ and $\text{gcd}(a,b,c)=1$.