arXiv · 0911.2660
Maximum GCD Among Pairs of Random Integers
Abstract
Fix $\alpha >0$, and sample $N$ integers uniformly at random from $\{1,2,\ldots ,\lfloor e^{\alpha N}\rfloor \}$. Given $\eta >0$, the probability that the maximum of the pairwise GCDs lies between $N^{2-\eta }$ and $N^{2+\eta}$ converges to 1 as $N\to \infty $. More precise estimates are obtained. This is a Birthday Problem: two of the random integers are likely to share some prime factor of order $N^2/\log [N]$. The proof generalizes to any arithmetical semigroup where a suitable form of the Prime Number Theorem is valid.
Explore related subjects
Keep this discovery
R. W. R. Darling, E. E. Pyle. 2009-11-13. Maximum GCD Among Pairs of Random Integers. https://arxiv.org/abs/0911.2660
Cite the original work for its findings. Save a collection to share your selection of sources.