Limit Theorems for Empirical Density of Greatest Common Divisors
نویسندگان
چکیده
The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical density. We will also obtain a sharp rate of convergence to the normal distribution for the central limit theorem. Some generalizations are provided.
منابع مشابه
Some convergence results on quadratic forms for random fields and application to empirical covariances
Limit theorems are proved for quadratic forms of Gaussian random fields in presence of long memory. We obtain a non central limit theorem under a minimal integrability condition, which allows isotropic and anisotropic models. We apply our limit theorems and those of Ginovian (1999) to obtain the asymptotic behavior of the empirical covariances of Gaussian fields, which is a particular example o...
متن کاملGeneralized Greatest Common Divisors, Divisibility Sequences, and Vojta’s Conjecture for Blowups
We apply Vojta’s conjecture to blowups and deduce a number of deep statements regarding (generalized) greatest common divisors on varieties, in particular on projective space and on abelian varieties. Special cases of these statements generalize earlier results and conjectures. We also discuss the relationship between generalized greatest common divisors and the divisibility sequences attached ...
متن کاملA Lattice Solution to Approximate Common Divisors
The approximate common divisor problem(ACDP) is to find one or more divisors which is the greatest common divisor of the approximate numbers a and b of two given numbers a0 and b0. Howgrave-Graham[7] has considered the special case of b = b0 and gave a continued fraction approach and a lattice approach to find divisors. Furthermore he raised another lattice approach for ACDP based on Coppersmit...
متن کاملIntegral Cayley Graphs Defined by Greatest Common Divisors
An undirected graph is called integral, if all of its eigenvalues are integers. Let Γ = Zm1 ⊗· · ·⊗Zmr be an abelian group represented as the direct product of cyclic groups Zmi of order mi such that all greatest common divisors gcd(mi,mj) ≤ 2 for i 6= j. We prove that a Cayley graph Cay(Γ, S) over Γ is integral, if and only if S ⊆ Γ belongs to the the Boolean algebra B(Γ) generated by the subg...
متن کاملA Jacobi Algorithm and Metric Theory for Greatest Common
Greatest common divisor algorithms are used to provide a natural motivation for considering a class of Jacobi-Perron algorithms which includes the original Jacobi algorithm. This work proves convergence and establishes metric properties for one of these algorithms. The proofs generalize to the larger class of algorithms. Full connections with the calculation of greatest common divisors will be ...
متن کامل