Counting tuples restricted by pairwise coprimality conditions
Given a subset A of the set {1, . . . , v}2 we say that (a1, . . . , av) exhibits pairwise coprimality over A if gcd(ai, aj ) = 1 for all (i, j) ∈ A. For a given positive x and a given set A we give an asymptotic formula for the number of (a1, . . . , av) with 1 ≤ a1, . . . , av ≤ x that exhibit pai...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/49018 |
| Acceso en línea: | http://hdl.handle.net/11441/49018 |
| Access Level: | acceso abierto |
| Palabra clave: | Pairwise coprimality Arithmetic function |
| Sumario: | Given a subset A of the set {1, . . . , v}2 we say that (a1, . . . , av) exhibits pairwise coprimality over A if gcd(ai, aj ) = 1 for all (i, j) ∈ A. For a given positive x and a given set A we give an asymptotic formula for the number of (a1, . . . , av) with 1 ≤ a1, . . . , av ≤ x that exhibit pairwise coprimality over A. This problem has been studied before by Hu. |
|---|