Approximate formulas for some functions of prime numbers

1962/03/01 by J. Barkley Rosser, Lowell Schoenfeld · 56 citations
Mathematics · #Advanced Mathematical Identities #Algebraic and Geometric Analysis #Analytic Number Theory Research

paper · pdf · doi:10.1215/ijm/1255631807

crossref issued 1962/03/01 · crossref published 1962/03/01 · crossref published-print 1962/03/01 · openalex publication_date 1962/03/01 · crossref created 2019/02/28 · crossref deposited 2024/01/30 · openalex created_date 2025/10/10 · crossref indexed 2026/07/30 · openalex updated_date 2026/08/01

Citations

• Explicit Bounds for Some Functions of Prime Numbers

Cited by

• An Explicit Result for the Sum of Two Almost Primes
• Improved Bounds for the Index Conjecture in Zero-Sum Theory
• An effective Bombieri-Vinogradov error term for sifting problems
• Embeddings of weighted projective spaces
• An Effective Version of the p-Curvature Conjecture for Order One Differential Equations
• Conjectures About Cyclic Numbers: Resolutions and Counterexamples
• Explicit zero-free regions for automorphic L-functions
• Counting polynomials with positive roots
• Large gaps between values of several binary quadratic forms
• On the verification of a Nicolas inequality
• A lower bound for the number of Egyptian fractions
• The Diophantine Frobenius Problem revisited
• Answer to a Question of Hung and Tiep on Conductors of Cyclotomic Integers
• Liftability of periodic mapping classes under alternating covers
• Bounds for sets of remainders
• Alpay Folded Prime Enumerator via gcd and Floors: Exact Enumeration, Record-Lift, and Non-Synonymy/Minimality Certificates
• Parameterized complexity of quantum invariants
• Superior Highly Composite Numbers and the Explicit Upper Bound of Generalized Divisor Functions
• On the constant factor in several related asymptotic estimates
• Bounds on the Minkowski constants and a function involving φ
• Topics In Primitive Roots
• The modified prime sieve for primitive elements in finite fields
• The probability of Riemann's hypothesis being true is equal to 1
• A quantum algorithm for computing the Carmichael function
• Homothéties explicites des représentations ℓ-adiques
• Cannonball Polygons with Multiplicities
• Updating an upper bound of Erik Westzynthius
• Factors of Sparse Polynomials are Sparse
• Faster Sparse Multivariate Polynomial Interpolation of Straight-Line\n Programs
• Behaviour of the sequence ϑ_n = ϑ(p_n)
• Fractal curves from prime trigonometric series
• A computational history of prime numbers and Riemann zeros
• An effective analytic recurrence for prime numbers
• Products of Factorials Modulo p
• On the arithmetic and geometric means of the prime numbers
• Primitive Roots In Short Intervals
• On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
• Multiple Mertens evaluations
• Ramanujan and Labos primes, their generalizations and classifications of primes
• Remarks on Robin's and Niocolas Inequalities
• About one matrix of composite numbers and her applications
• New bounds for the sum of the first n prime numbers
• On the Number of Connected Components of Ranges of Divisor Functions
• Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers
• Computing Euler products and coefficients of classical modular forms for twisted L-functions
• Squarefree Integers And Extreme Values Of Some Arithmetic Functions
• On the Complexity of Problems on Graphs Defined on Groups
• The determination of norm-Euclidean cyclic cubic fields
• Linear independence of values of logarithms revisited
• Simultaneous Elements Of Prescribed Multiplicative Orders
• An elemetary proof of an estimate for a number of primes less than the product of the first n primes
• An Investigation Into Several Explicit Versions of Burgess' Bound
• A bias in Mertens' product formula
• About the Primality of Primorials
• A Rigorous Error Bound for the TG Kernel in Prime Counting
• Continued fractions constructed from prime numbers