betaFeedback

WorksMathematics

The distribution of greatest common divisors of binomial coefficients and their upper indices

Abstract

For positive integers n,dn,d, let Ad(n)A_d(n) denote the number of integers 0≤k≤n0\le k\le n such that gcd⁡(n,(nk))=d\gcd\bigl(n,\binom nk\bigr)=d, and put Sd(x)=∑n≤xAd(n)S_d(x)=\sum_{n\le x}A_d(n). We prove that, for each fixed integer d≥2d\ge2, Sd(x)∼d−1d c xlog⁡x(x→∞),c=1.526453… S_d(x)\sim\frac{d-1}{d}\,\mathfrak c\,\frac{x}{\log x}\qquad(x\to\infty),\qquad \mathfrak c=1.526453\ldots The key step is to extend the coprimality result of Ford and Konyagin to arbitrary fixed parameters d≥2d\ge2 and 1≤j<d1\le j<d, obtaining #{m≤x:gcd⁡(m,(dmjm))=1}∼cxlog⁡x. \#\Bigl\{m\le x:\gcd\Bigl(m,\binom{dm}{jm}\Bigr)=1\Bigr\} \sim\mathfrak c\frac x{\log x}. The zero set of the corresponding Kummer carry function is a finite union of intervals of total measure 1/21/2. We combine this property with estimates for small prime factors, Selberg trigonometric approximation, and exponential sum estimates over primes to count simultaneous carry conditions. We further prove that, for every fixed integer e≥1e\ge1, #{m≤x:gcd⁡(m,(dmjm))=e}∼cexlog⁡x. \#\Bigl\{m\le x:\gcd\Bigl(m,\binom{dm}{jm}\Bigr)=e\Bigr\} \sim\frac{\mathfrak c}{e}\frac x{\log x}.

Paper details

vlnc:W_ptghkbzx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…