Greatest common divisor of two specified sequences of numbers (search for equality)

Question

I consider two sequences of numbers $A=\{a_1,...,a_n\}$ and $B=\{k-a_1,...,k-a_n\}$, where $a_1 \le a_2 \le ... \le a_n \le k$.

I am looking for such conditions under which: $\gcd(a_1,...,a_n) = \gcd(k-a_1,...,k-a_n)=1$.

In more general form: $\gcd(a_1,...,a_n) = \gcd(k-a_1,...,k-a_n) \ge 1$.

---

It can be seen that the problem is solved only in a particular forms.

I found only four particular solutions.

1. If there is such a number $\exists a_s \in A: k-a_t=a_s$, where $a_t \in A$ then $\gcd(a_1,...,a_n) = \gcd(k-a_1,...,k-a_n)$.

2. Let $\gcd(a_1,...,a_n)=e$ and $\gcd(a_n-a_1,...,a_2-a_1)=E$. If $e=E$ and $e\mid k$, then $\gcd(a_1,...,a_n) = \gcd(k-a_1,...,k-a_n)$.

3. Let $P=p_1 \cdot ... \cdot p_n$ denotes the primorial equaling the product of the first $n$ prime numbers and $p_i$ is the $i^{th}$ prime number. Let $a_i=\frac{P}{p_i}$ and $k=P$, then $\gcd(a_1,...,a_n) = \gcd(k-a_1,...,k-a_n) = 1$.

4. Let $\gcd(k-a_1,...,k-a_n) = 1$ and $a_i\mid k, \forall a_i \in A$, then $\gcd(a_1,...,a_n) = 1$.

I am convinced that there are other solutions, but I can not find them yet. I will be grateful for any help.

Answer 1

Here is a try. Call $k$ to be good, if $d_k\triangleq (k-a_1,\dots,k-a_n)>(a_1,\dots,a_n)=1$. If $k$ is good, it then follows that, there is a prime $p$, such that $p\mid k-a_i$ for every $1\leqslant i \leqslant n$. In particular, $a_1\equiv \cdots\equiv a_n\equiv k\pmod{p}$. Hence, if $k$ is good, then there necessarily is a prime $p$ at which $a_1,\dots,a_n$ are all congruent.

Now, if $k$ is such that, if for all prime $p$, there is an $i$ with $k-a_i\not\equiv 0\pmod{p}$, we then have that $(k-a_1,\dots,k-a_n)=1$. In particular, a sufficient condition is as follows. If the collection $(a_1,\dots,a_n)$ is such that, for every prime $p$, there exists $i <j$ such that $a_i\not\equiv a_j\pmod{p}$, we have that for any $k$, $(k-a_1,\dots,k-a_n)=1$.