The Distribution of G.C.D.s of Shifted Primes and Lucas Sequences

preprint2022arXivOpen access

Abstract

Let (un)n≥0(u_n)_{n \ge 0} be a nondegenerate Lucas sequence and gu(n)g_u(n) be the arithmetic function defined by gcd⁡(n,un).\gcd(n, u_n). Recent studies have investigated the distributional characteristics of gug_u. Numerous results have been proven based on the two extreme values 11 and nn of gu(n)g_{u}(n). Sanna investigated the average behaviour of gug_{u} and found asymptotic formulas for the moments of log⁡gu\log g_{u}. In a related direction, Jha and Sanna investigated properties of gug_{u} at shifted primes. In light of these results, we prove that for each positive integer λ,λ, we have ∑p≤xp prime(log⁡gu(p−1))λ∼Pu,λπ(x),\sum_{\substack{p\le x\\p\text{ prime}}} (\log g_{u}(p-1))^λ \sim P_{u,λ}π(x), where Pu,λP_{u, λ} is a constant depending on uu and λλ which is expressible as an infinite series. Additionally, we provide estimates for Pu,λP_{u,λ} and Mu,λ,M_{u,λ}, where Mu,λM_{u, λ} is the constant for an analogous sum obtained by Sanna [J. Number Theory 191 (2018), 305-315]. As an application of our results, we prove upper bounds on the count #{p≤x:gu(p−1)>y}\#\{p\le x : g_{u}(p-1)>y\} and also establish the existence of infinitely many runs of mm consecutive primes pp in bounded intervals such that gu(p−1)>yg_{u}(p-1)>y based on a breakthrough of Zhang, Maynard, Tao, et al. on small gaps between primes. Exploring further in this direction, it turns out that for Lucas sequences with nonunit discriminant, we have max⁡{gu(n):n≤x}≫x\max\{g_{u}(n) : n \le x\} \gg x. As an analogue, we obtain that that max⁡{gu(p−1):p≤x}≫x0.4736\max\{g_u(p-1) : p \le x\} \gg x^{0.4736} unconditionally, while max⁡{gu(p−1):p≤x}≫x1−o(1)\max\{g_u(p-1): p \le x\} \gg x^{1 - o(1)} under the hypothesis of Montgomery's or Chowla's conjecture.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.