Mathematics > Number Theory
[Submitted on 22 Sep 2013 (v1), last revised 7 May 2014 (this version, v3)]
Title:Pairwise non-coprimality of triples
View PDFAbstract:We say that $(a_1,...,a_k)$ is pairwise non-coprime if $\gcd(a_i,a_j) \ne 1$ for all $1 \le i <j \le k$. Let $a_1,a_2,a_3$ be positive integers less than $H$. We obtain an asymptotic formula for the number of $(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 $\varphi(n)$ be the Euler totient function. We also give an upper bound on the error term in an asymptotic formula for $\sum_{n=1}^H (\varphi(n)/n)^m$ for $m \ge 2$ and as $H \rightarrow \infty$.
Submission history
From: Randell Heyman [view email][v1] Sun, 22 Sep 2013 08:51:33 UTC (6 KB)
[v2] Wed, 16 Oct 2013 04:59:01 UTC (6 KB)
[v3] Wed, 7 May 2014 07:11:17 UTC (6 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.