arXiv Analytics

Sign in

arXiv:math/0610275 [math.NT]AbstractReferencesReviewsResources

On exponentially coprime integers

László Tóth

Published 2006-10-09Version 1

The integers $n=\prod_{i=1}^r p_i^{a_i}$ and $m=\prod_{i=1}^r p_i^{b_i}$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. We estimate the number of pairs of exponentially coprime integers $n,m\le x$ having the prime factors $p_1,...,p_r$ and show that the asymptotic density of pairs of exponentially coprime integers having $r$ fixed prime divisors is $(\zeta(2))^{-r}$.

Journal: Pure Math. Appl. (PU.M.A.), 15 (2004), 343-348
Categories: math.NT
Subjects: 11A05, 11A25, 11N37
Related articles: Most relevant | Search more
arXiv:math/0610582 [math.NT] (Published 2006-10-19)
On the asymptotic densities of certain subsets of $\bf N^k$
arXiv:1405.3587 [math.NT] (Published 2014-05-14, updated 2015-09-14)
On the number of prime factors of values of the sum-of-proper-divisors function
arXiv:1511.02388 [math.NT] (Published 2015-11-07)
Orders of reductions of elliptic curves with many and few prime factors