2014
DOI: 10.7169/facm/2014.51.2.2
|View full text |Cite
|
Sign up to set email alerts
|

Sur les chiffres des nombres premiers translatés

Abstract: The aim of this work is to prove new results on a class of digital functions with special emphasis on shifted primes as arguments. Our method lies on the estimate of exponential sums of the form n x Λ(n) exp(2iπf (n + cn) + βn) where f a digital function, c = (cn) is an almostperiodic sequence in Z and β is a real parameter, which extend the works of and to the case of the shifted prime numbers satisfying a digital constraint.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…Using elementary means, the authors of [13] improved (1.7) to the following (1.6). Then, there exists ρ f,b,q > 0 such that for every integer c ∈ Z and β ∈ R, j ∈ J 2 and x 2, we have…”
Section: Introductionmentioning
confidence: 94%
See 2 more Smart Citations
“…Using elementary means, the authors of [13] improved (1.7) to the following (1.6). Then, there exists ρ f,b,q > 0 such that for every integer c ∈ Z and β ∈ R, j ∈ J 2 and x 2, we have…”
Section: Introductionmentioning
confidence: 94%
“…Later Mkaouar, Ouled Azaiez and Thuswaldner [13] improved these results to the case of the shifted prime numbers with a (T, θ)-almost periodic sequence satisfying a digital constraint (knowing that a sequence (c n ) is (T, θ)-almost periodic if for T ∈ N and 0 θ < 1 there exists a sequence (e n ) purely periodic such that the number of integers less than or equal to N satisfying c n ̸ = e n is O(N θ )). Their method lies on what follows Theorem C [13, Théorème 2.12].…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation
“…q-additive functions have been extensively discussed in the literature, in particular their asymptotic distribution (see for instance [4,6,8,[16][17][18][19][20]). Let F be the set of "digital functions" f = 0≤k<q a k |.| k , such that the real sequence a 0 , .…”
Section: Strongly Q-additive Functions and Digital Functionsmentioning
confidence: 99%
“…Strongly q-additive functions, particularly their asymptotic distribution, have been extensively discussed in the literature (see, for example, [2,3,[10][11][12]). Let F be the set of digital functions f = 0≤k<q a k | • | k such that the real sequence a 0 , .…”
Section: Introductionmentioning
confidence: 99%