In this article, we study sums related to the Lehmer problem over short intervals, and give two asymptotic formulae for them. The original Lehmer problem is to count the numbers coprime to a prime such that the number and the its number theoretical inverse are in different parities in some intervals. The numbers which satisfy these conditions are called Lehmer numbers. It prompts a series of investigations, such as the investigation of the error term in the asymptotic formula. Many scholars investigate the generalized Lehmer problems and get a lot of results. We follow the trend of these investigations and generalize the Lehmer problem
International audienceLet $n ≥ 2$ be an integer and denote by $\theta_n$ the real root in $(0, 1)$ o...
In this paper we study the problem of the discrepancy of Euler's phi-function and, extending a resul...
We consider a generalization of the lcm-sum function, and we give two kinds of asymptotic formulas f...
summary:About Lehmer's number, many people have studied its various properties, and obtained a serie...
summary:For $1\le c\le p-1$, let $E_1,E_2,\dots ,E_m$ be fixed numbers of the set $\{0,1\}$, and let...
AbstractLet p be an odd prime and a be an integer coprime to p. Denote by N(a,p) the number of pairs...
We consider a generalisation of the classical Lehmer problem about the distribution of modular inver...
Abstract. Let q ≥ 3 be an odd integer and a be an integer coprime to q. Denote by N(a, q) the number...
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing ...
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing ...
AbstractLet q be an odd positive integer and let a be an integer coprime to q. For each integer b co...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
summary:Let $p$ be an odd prime and $c$ a fixed integer with $(c, p)=1$. For each integer $a$ with $...
Let k 651 be an integer. We prove that a suitable asymptotic formula for the average number of repre...
AbstractLet {an}n = 0∞ be an integer sequence defined by the non-degenerate binary linear recurrence...
International audienceLet $n ≥ 2$ be an integer and denote by $\theta_n$ the real root in $(0, 1)$ o...
In this paper we study the problem of the discrepancy of Euler's phi-function and, extending a resul...
We consider a generalization of the lcm-sum function, and we give two kinds of asymptotic formulas f...
summary:About Lehmer's number, many people have studied its various properties, and obtained a serie...
summary:For $1\le c\le p-1$, let $E_1,E_2,\dots ,E_m$ be fixed numbers of the set $\{0,1\}$, and let...
AbstractLet p be an odd prime and a be an integer coprime to p. Denote by N(a,p) the number of pairs...
We consider a generalisation of the classical Lehmer problem about the distribution of modular inver...
Abstract. Let q ≥ 3 be an odd integer and a be an integer coprime to q. Denote by N(a, q) the number...
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing ...
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing ...
AbstractLet q be an odd positive integer and let a be an integer coprime to q. For each integer b co...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
summary:Let $p$ be an odd prime and $c$ a fixed integer with $(c, p)=1$. For each integer $a$ with $...
Let k 651 be an integer. We prove that a suitable asymptotic formula for the average number of repre...
AbstractLet {an}n = 0∞ be an integer sequence defined by the non-degenerate binary linear recurrence...
International audienceLet $n ≥ 2$ be an integer and denote by $\theta_n$ the real root in $(0, 1)$ o...
In this paper we study the problem of the discrepancy of Euler's phi-function and, extending a resul...
We consider a generalization of the lcm-sum function, and we give two kinds of asymptotic formulas f...