scholarly journals On a Mean Value Theorem for the Remainder Term in the Prime Number Theorem for Short Arithmetic Progressions

1971 ◽  
Vol 47 (8) ◽  
pp. 653-657
Author(s):  
Yoichi MOTOHASHI
Keyword(s):  
Prime Number ◽  
Remainder Term ◽  
Prime Number Theorem ◽  
Mean Value ◽  
Arithmetic Progressions ◽  
Mean Value Theorem

scholarly journals Error term of the mean value theorem for binary Egyptian fractions

2020 ◽  
Vol 18 (1) ◽  
pp. 1250-1265
Author(s):  
Xuanxuan Xiao ◽  
Wenguang Zhai
Keyword(s):  
Prime Number ◽  
Riemann Hypothesis ◽  
Error Term ◽  
Short Interval ◽  
Power Saving ◽  
Prime Number Theorem ◽  
Mean Value ◽  
Mean Value Theorem ◽  
Egyptian Fractions ◽  
The Mean

Abstract In this article, the error term of the mean value theorem for binary Egyptian fractions is studied. An error term of prime number theorem type is obtained unconditionally. Under Riemann hypothesis, a power saving can be obtained. The mean value in short interval is also considered.

scholarly journals Integers free of small prime factors in arithmetic progressions

2000 ◽  
Vol 157 ◽  
pp. 103-127 ◽  
Author(s):  
Ti Zuo Xuan
Keyword(s):  
Prime Number ◽  
Short Range ◽  
Error Term ◽  
Real Zero ◽  
Prime Number Theorem ◽  
Arithmetic Progressions ◽  
Real Character ◽  
Dickman Function ◽  
Prime Factors ◽  
Positive Integers

For real x ≥ y ≥ 2 and positive integers a, q, let Φ(x, y; a, q) denote the number of positive integers ≤ x, free of prime factors ≤ y and satisfying n ≡ a (mod q). By the fundamental lemma of sieve, it follows that for (a,q) = 1, Φ(x,y;a,q) = φ(q)-1, Φ(x, y){1 + O(exp(-u(log u- log2 3u- 2))) + (u = log x log y) holds uniformly in a wider ranges of x, y and q.Let χ be any character to the modulus q, and L(s, χ) be the corresponding L-function. Let be a (‘exceptional’) real character to the modulus q for which L(s, ) have a (‘exceptional’) real zero satisfying > 1 - c0/log q. In the paper, we prove that in a slightly short range of q the above first error term can be replaced by where ρ(u) is Dickman function, and ρ′(u) = dρ(u)/du.The result is an analogue of the prime number theorem for arithmetic progressions. From the result can deduce that the above first error term can be omitted, if suppose that 1 < q < (log q)A.

scholarly journals Pretentious multiplicative functions and the prime number theorem for arithmetic progressions

2013 ◽  
Vol 149 (7) ◽  
pp. 1129-1149 ◽  
Author(s):  
Dimitris Koukoulopoulos
Keyword(s):  
Prime Number ◽  
Elementary Proof ◽  
Counting Function ◽  
Prime Number Theorem ◽  
Arithmetic Progressions ◽  
Multiplicative Functions ◽  
Primes In Arithmetic Progressions

AbstractBuilding on the concept ofpretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Sign in / Sign up

Export Citation Format

Share Document