English

Pairwise non-coprimality of triples

Number Theory 2014-05-08 v3

Abstract

We say that (a1,...,ak)(a_1,...,a_k) is pairwise non-coprime if gcd(ai,aj)1\gcd(a_i,a_j) \ne 1 for all 1i<jk1 \le i <j \le k. Let a1,a2,a3a_1,a_2,a_3 be positive integers less than HH. We obtain an asymptotic formula for the number of (a1,a2,a3)(a_1,a_2,a_3) that are pairwise non-coprime. The probability that a randomly chosen unbounded positive integer triple is pairwise non-coprime is approximately 17.4%. Let φ(n)\varphi(n) be the Euler totient function. We also give an upper bound on the error term in an asymptotic formula for n=1H(φ(n)/n)m\sum_{n=1}^H (\varphi(n)/n)^m for m2m \ge 2 and as HH \rightarrow \infty.

Keywords

Cite

@article{arxiv.1309.5578,
  title  = {Pairwise non-coprimality of triples},
  author = {Randell Heyman},
  journal= {arXiv preprint arXiv:1309.5578},
  year   = {2014}
}

Comments

8 pages. An anonymous referee has pointed out that the result Lemma 2 is already known. A comment to that effect has been added. It has also pointed out that the probability that three positive integers are pairwise non-coprime is known and a comment to that effect has been added. Two minor typographical errors have been corrected

R2 v1 2026-06-22T01:31:42.875Z