pith. sign in

arxiv: 1403.2769 · v1 · pith:PDLPAZSLnew · submitted 2014-03-11 · 🧮 math.NT

Counting tuples restricted by coprimality conditions

classification 🧮 math.NT
keywords ldotscoprimalitygivenpairwiseasymptoticbetterconditionscounting
0
0 comments X
read the original abstract

Given a set $A=\{(i_1,j_1),\ldots,(i_m,j_m)\}$ we say that $(a_1,\ldots,a_v)$ exhibits pairwise coprimality if $\gcd(a_i,a_j) = 1$ for all $(i,j)\in A$. For a given positive $x$ we give an asymptotic formula for the number of $(a_1,\ldots,a_v)$ with $1 \le a_1,\ldots,a_v \le x$ that exhibit pairwise coprimality. Our error term is better than that of Hu.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.