
For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with explicit error terms. We also present results for higher moments along with computational data which support the results for the second, third, fourth, and fifth moments. The analogous question for integers is studied by Diaconis and Erdös.
13 pages, 4 figures
Dedekind zeta function, Mathematics - Number Theory, 11A05, moment, 11N37, 11N37, 11A05, 11K65, 60E05, FOS: Mathematics, 11K65, Gaussian integer, gcd, 60E05, Number Theory (math.NT)
Dedekind zeta function, Mathematics - Number Theory, 11A05, moment, 11N37, 11N37, 11A05, 11K65, 60E05, FOS: Mathematics, 11K65, Gaussian integer, gcd, 60E05, Number Theory (math.NT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
