Let $n$ be a positive integer. Let $A_n$ denote the set of primes $p$ such that there exists positive integers $a,b$ satisfying $$\frac{a+b}{p} \text{ and } \frac{a^n + b^n}{p^2}$$ are both integers that are relatively prime to $p$. If $A_n$ is finite, let $f(n)$ denote $|A_n|$. a) Prove that $A_n$ is finite if and only if $n \not = 2$. b) Let $m,k$ be odd positive integers and let $d$ be their gcd. Show that $$f(d) \leq f(k) + f(m) - f(km) \leq 2 f(d).$$

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

Determine all pairs of positive integers $m, n,$ satisfying the equality $(2^{m}+1;2^n+1)=2^{(m;n)}+1$ , where $(a;b)$ is the greatest common divisor

Solve the equation $m^{gcd(m,n)} = n^{lcm(m,n)}$ in positive integers, where gcd($m, n$) – greatest common divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function. [i]Proposed by James Rickards, Canada[/i]

Show that there exists some [b]positive[/b] integer $k$ with $$\gcd(2012,2020)=\gcd(2012+k,2020)$$$$=\gcd(2012,2020+k)=\gcd(2012+k,2020+k).$$

If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.

The Fibonacci sequence is defined by \[ a_{n+1} = a_n + a_{n-1}, n \geq 1, a_0 = 0, a_1 = a_2 = 1. \] Find the greatest common divisor of the 1960-th and 1988-th terms of the Fibonacci sequence.

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$.

$a,b$ are naturals and $$a \times GCD(a,b)+b \times LCM(a,b)<2.5 ab$$. Prove that $b|a$

Find all continuously differentiable functions $ f: \mathbb{R}\to\mathbb{R}$ such that for every rational number $ q,$ the number $ f(q)$ is rational and has the same denominator as $ q.$ (The denominator of a rational number $ q$ is the unique positive integer $ b$ such that $ q\equal{}a/b$ for some integer $ a$ with $ \gcd(a,b)\equal{}1.$) (Note: $ \gcd$ means greatest common divisor.)

Let $a$ and $b$ be positive integers such that $\text{gcd}(a, b) + \text{lcm}(a, b)$ is a multiple of $a+1$. If $b \le a$, show that $b$ is a perfect square.

For a prime $q$, let $\Phi_q(x)=x^{q-1}+x^{q-2}+\cdots+x+1$. Find the sum of all primes $p$ such that $3 \le p \le 100$ and there exists an odd prime $q$ and a positive integer $N$ satisfying \[\dbinom{N}{\Phi_q(p)}\equiv \dbinom{2\Phi_q(p)}{N} \not \equiv 0 \pmod p. \][i]Proposed by Sammy Luo[/i]

Prove that \[ \gcd{\left({n \choose 1},{n \choose 2},\dots,{n \choose {n - 1}}\right)} \] is a prime if $n$ is a power of a prime, and 1 otherwise.

Natural numbers $a$ and $b$ are relatively prime. Prove that the greatest common divisor of $(a+b)$ and $(a^2+b^2)$ is either $1$ or $2$.